A note on top-down deterministic languages

DOI10.1007/BF01935868zbMath0195.30802MaRDI QIDQ5591520

Derick Wood

Publication date: 1969

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

languages, automata, networks

Related Items (3)

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

Cites Work

• Unnamed Item
• Structural equivalence of context-free grammars
• Top-down syntax nalysis
• Syntactic Analysis and Operator Precedence
• Properties of deterministic top down grammars
• Syntax-Directed Transduction
• Notes on top-down languages
• The theory of left factored languages: part 2
• On the translation of languages from left to right

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