scientific article; zbMATH DE number 6851912

DOI10.4230/LIPICS.MFCS.2016.79MaRDI QIDQ4608642zbMATH OpenFDO

Authors Paola Quaglia

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2016.79

zbMATH Keywords

bottom-up parsingLALR(1) grammarsLR(1) grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Practical arbitrary lookahead LR parsing
• Parsing beyond context-free grammars
• Run-time extensible deterministic top-down parsing
• Context-free grammars with lookahead
• Parsing expression grammars: a recognition-based syntactic foundation
• scientific article; zbMATH DE number 2050923
• A predictive bottom-up parser
• Top-down parsing of conjunctive languages

Cited in

(15)

• Simple computation of LALR(1) lookahead sets
• Tabular parsing and algebraic transformations
• scientific article; zbMATH DE number 434493 (Why is no real title available?)
• A new analysis of LALR formalisms
• scientific article; zbMATH DE number 4213462 (Why is no real title available?)
• scientific article; zbMATH DE number 4045204 (Why is no real title available?)
• A general model for fixed look-ahead lr parsers
• scientific article; zbMATH DE number 1294066 (Why is no real title available?)
• Lar(m, c, l) grammars
• Suffix languages in Lr parsing
• scientific article; zbMATH DE number 827977 (Why is no real title available?)
• Parse condition: symbolic encoding of LL(1) parsing
• Efficient LR(1) processor construction
• A predictive bottom-up parser
• Practical arbitrary lookahead LR parsing

This page was built for publication:

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