The theory of left factored languages: part 2

DOI10.1093/comjnl/13.1.55zbMath0188.03202OpenAlexW2126530105MaRDI QIDQ5581628

Derick Wood

Publication date: 1970

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

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

zbMATH Keywords

languages, automata, networks

Related Items

Notes on top-down languages, A note on top-down deterministic languages, Recursive descent parsing for Boolean grammars, Necessary and sufficient conditions for a power language to be deterministic, Efficient parsing algorithms for general context-free parsers, Simple chain grammars and languages