On LLP(k) parsers

DOI10.1016/0022-0000(82)90054-XzbMath0482.68083MaRDI QIDQ1162825

Jan Pittl

Publication date: 1982

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

deterministic parsersleft local precedence parsingmixed top-down-bottom-up parsing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (1)

On LLP(k) grammars and languages

Cites Work

• Context-free grammars: covers, normal forms, and parsing
• On LLP(k) grammars and languages
• Economy of description by parsers, DPDA's, and PDA's
• Characteristic parsing: A framework for producing compact deterministic parsers. II
• Strict deterministic grammars
• On deterministic canonical bottom-up-parsing
• On the Parsing of Deterministic Languages
• Data Flow Analysis in the Presence of Procedure Calls
• Simple LR(k) grammars
• On the translation of languages from left to right
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On LLP(k) parsers