A predictive bottom-up parser

DOI10.1007/S00607-010-0134-8zbMath1234.68152OpenAlexW1971174339MaRDI QIDQ644894

Riad Jabri

Publication date: 7 November 2011

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0134-8

zbMATH Keywords

algorithmsconflictserror recoveryLALR parsingpredictive parsing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• A formal frame for robust parsing
• On the size of parsers and \(\text{LR}(k)\)-grammars
• A new algorithm for linear regular tree pattern matching
• An LR parser with pre-determined reduction goals
• Automatic recursion engineering of reduction incorporated parsers
• A Syntax-Error-Handling Technique and Its Experimental Analysis
• Noncanonical LALR(1) Parsing
• Noncanonical Extensions of Bottom-Up Parsing Techniques
• Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time
• Even faster generalized LR parsing

This page was built for publication: A predictive bottom-up parser