Deterministic parsing for augmented context-free grammars

DOI10.1007/3-540-60246-1_139MaRDI QIDQ3569023zbMATH OpenOpenAlexFDO

Authors Luca Breveglieri, Stefano Crespi Reghizzi, A. Cherubini

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60246-1_139

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Deterministic parsing with P colony automata
• Parsing beyond context-free grammars
• Grammar partitioning and modular deterministic parsing
• Fast deterministic parsers for transition networks
• Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
• Run-time extensible deterministic top-down parsing
• scientific article; zbMATH DE number 4197438
• scientific article; zbMATH DE number 1962786
• scientific article; zbMATH DE number 1951550
• A parallel parsing algorithm for arbitrary context-free grammars

Cited in

(2)

• Linear-time suffix parsing for deterministic languages
• Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems

This page was built for publication: Deterministic parsing for augmented context-free grammars

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