On top-to-bottom recognition and left recursion
From MaRDI portal
Publication:5512450
DOI10.1145/365719.365984zbMath0138.10107OpenAlexW2152445600MaRDI QIDQ5512450
Publication date: 1966
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/365719.365984
Related Items
Notes on top-down languages, A survey of normal form covers for context-free grammars, On linear languages recognized by deterministic biautomata, A method for transforming grammars into LL(k) form, Unnamed Item, The ELL(1) parser generator and the error recovery mechanism, On the covering problem for left-recursive grammars, Unnamed Item