A note on top-down deterministic languages

DOI10.1007/BF01935868MaRDI QIDQ5591520zbMATH OpenFDO

Authors D. Wood

Publication date 1969

Published in BIT (Search for Journal in Brave)

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

zbMATH Keywords

languages, automata, networks

Cites work

• 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
• Structural equivalence of context-free grammars
• Syntactic Analysis and Operator Precedence
• Syntax-Directed Transduction
• The theory of left factored languages: part 2
• Top-down syntax nalysis

Cited in

(3)

• Efficient parsing algorithms for general context-free parsers
• The ELL(1) parser generator and the error recovery mechanism
• Theory of formal grammars

This page was built for publication: A note on top-down deterministic languages

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