Notes on top-down languages

DOI10.1007/BF01946814zbMath0187.27905WikidataQ54260049 ScholiaQ54260049MaRDI QIDQ5579033

Reino Kurki-Suonio

Publication date: 1969

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

languages, automata, networks

Related Items

On the Transformation of LL(k)-linear Grammars to LL(1)-linear, The hardest \(\operatorname{LL}(k)\) language, Dark energy homogeneity in general relativity: Are we applying it correctly?, A note on top-down deterministic languages, Recursive descent parsing for Boolean grammars, Epsilon weak precedence grammars and languages, Parallel parsing on the connection machine, Parallel \(LL\) parsing, Streaming algorithms for language recognition problems, A method for transforming grammars into LL(k) form, Conjunctive and Boolean grammars: the true general case of the context-free grammars, On the transformation of LL\((k)\)-linear to LL(1)-linear grammars, The Hardest LL(k) Language, A characterization ofLL(1) grammars, LL-regular grammars, A characterization of s-languages, Top-down syntax nalysis, Theory of formal grammars

Cites Work

• On top-to-bottom recognition and left recursion
• Syntax-Directed Transduction
• The theory of left factored languages: part 2