Top-down syntax nalysis

DOI10.1007/BF00289517MaRDI QIDQ2551318zbMATH OpenFDO

Authors Donald E. Knuth

Publication date 1971

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00289517

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A syntax directed compiler for ALGOL 60
• An efficient context-free parsing algorithm
• Design of a separable transition-diagram compiler
• EULER: A generalization of ALGOL and its formal definition: Part 1
• scientific article; zbMATH DE number 3490487 (Why is no real title available?)
• Notes on top-down languages
• On the translation of languages from left to right
• Properties of deterministic top-down grammars
• Summary of the Issue
• Syntactic analysis by digital computer
• Syntax-Directed Transduction

Cited in

(30)

• A method for transforming grammars into LL(k) form
• On the relationship between the LL(k) and LR(k) grammars
• Efficient parsing algorithms for general context-free parsers
• LL(1) grammars supporting an efficient error handling
• On computing the transitive closure of a relation
• The ELL(1) parser generator and the error recovery mechanism
• Phrase structures, non-determinism and backtracking
• Simple chain grammars and languages
• On LL-regular grammars
• Fast deterministic parsers for transition networks
• Syntax checking either way
• Anwendung von Graphenalgorithmen auf allgemeinere Problemklassen
• Recursive descent parsing for Boolean grammars
• Context-free ambiguity detection using multi-stack pushdown automata
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• On comparingLL(k) andLR(k) grammars
• Time complexity in the operation of a two-way parser
• Streaming algorithms for language recognition problems
• scientific article; zbMATH DE number 3757742 (Why is no real title available?)
• A characterization ofLL(1) grammars
• On the Transformation of LL(k)-linear Grammars to LL(1)-linear
• When maybe is not good enough
• A note on top-down deterministic languages
• A representation theorem of infinite dimensional algebras and applications to language theory
• On the transformation of LL(k)-linear to LL(1)-linear grammars
• Syntax checking either way
• Reversible Top-Down Syntax Analysis
• \(\mathrm{LL}(k)\) cooperating distributed grammar systems
• On the complexity of LL(k) testing
• Reversible top-down syntax analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2551318)