A predictive bottom-up parser
From MaRDI portal
Publication:644894
DOI10.1007/s00607-010-0134-8zbMath1234.68152MaRDI QIDQ644894
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
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
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