Top-down syntax nalysis

DOI10.1007/BF00289517zbMath0233.68022MaRDI QIDQ2551318

Donald E. Knuth

Publication date: 1971

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (29)

On the Transformation of LL(k)-linear Grammars to LL(1)-linear ⋮ Reversible top-down syntax analysis ⋮ When Maybe is not good enough ⋮ Efficient Construction of Near-Optimal Binary and Multiway Search Trees ⋮ A note on top-down deterministic languages ⋮ Recursive descent parsing for Boolean grammars ⋮ Syntax checking either way ⋮ Streaming algorithms for language recognition problems ⋮ A method for transforming grammars into LL(k) form ⋮ On the transformation of LL\((k)\)-linear to LL(1)-linear grammars ⋮ Reversible Top-Down Syntax Analysis ⋮ On the relationship between the LL(k) and LR(k) grammars ⋮ Unnamed Item ⋮ A characterization ofLL(1) grammars ⋮ Efficient parsing algorithms for general context-free parsers ⋮ LL(1) grammars supporting an efficient error handling ⋮ Syntax checking either way ⋮ A representation theorem of infinite dimensional algebras and applications to language theory ⋮ On computing the transitive closure of a relation ⋮ Fast deterministic parsers for transition networks ⋮ The ELL(1) parser generator and the error recovery mechanism ⋮ Phrase structures, non-determinism and backtracking ⋮ On comparingLL(k) andLR(k) grammars ⋮ Simple chain grammars and languages ⋮ On LL-regular grammars ⋮ Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata ⋮ Time complexity in the operation of a two-way parser ⋮ Anwendung von Graphenalgorithmen auf allgemeinere Problemklassen ⋮ On the complexity of LL(k) testing

Cites Work

• Unnamed Item
• A syntax directed compiler for ALGOL 60
• Summary of the Issue
• EULER: A generalization of ALGOL and its formal definition: Part 1
• Syntax-Directed Transduction
• An efficient context-free parsing algorithm
• Notes on top-down languages
• Properties of deterministic top-down grammars
• On the translation of languages from left to right
• Syntactic analysis by digital computer
• Design of a separable transition-diagram compiler

This page was built for publication: Top-down syntax nalysis