Eliminating null rules in linear time

DOI10.1093/comjnl/24.2.156zbMath0456.68089OpenAlexW2029168217MaRDI QIDQ3906449

Amiram Yehudai, Michael A. Harrison

Publication date: 1981

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/24.2.156

zbMATH Keywords

linear time algorithmcontext free grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Greibach normal form transformation, revisited ⋮ Deciding top-down determinism of regular tree languages ⋮ Boundedness testing for unambiguous context-free grammars ⋮ Normal form algorithms for extended context-free grammars

This page was built for publication: Eliminating null rules in linear time