Efficient parsing algorithms for general context-free parsers

DOI10.1016/0020-0255(75)90002-XzbMath0301.68024OpenAlexW2008335081MaRDI QIDQ1215404

A. Snelling, M. Bouckaert, Alain Pirotte

Publication date: 1975

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(75)90002-x

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (2)

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

Cites Work

• Unnamed Item
• Efficient parsing algorithms for general context-free parsers
• Top-down syntax nalysis
• Syntax-Directed Transduction
• An efficient context-free parsing algorithm
• The theory of left factored languages: part 2
• A note on top-down deterministic languages
• The parsing for general phrase-structure grammars
• On the translation of languages from left to right

This page was built for publication: Efficient parsing algorithms for general context-free parsers