Fast deterministic parsers for transition networks
From MaRDI portal
Publication:1789065
DOI10.1007/S00236-017-0308-3zbMATH Open1400.68093OpenAlexW2767148581MaRDI QIDQ1789065FDOQ1789065
Authors: Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti 
Publication date: 9 October 2018
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-017-0308-3
Recommendations
Cites Work
- LALR(1,1) parser generation for regular right part grammars
- On the definition of ELR(k) and ELL(k) grammars
- Constructing LR parsers for regular right part grammars
- A note on a proposed LALR parser for extended context-free grammars
- Characterization of extended \(\mathrm{LR}(k)\) grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Top-down syntax nalysis
- Properties of deterministic top-down grammars
- On the translation of languages from left to right
- Title not available (Why is that?)
- Complexity of extended vs. classic LR parsers
- Pascal. User manual and report. 2nd ed
- Formal languages and compilation
- Yet another generation of LALR parsers for regular right part grammars
- A simple realization of LR-parsers for regular right part grammars
- Design of a separable transition-diagram compiler
- Iterating iterated substitution
- On the relationship between LL(1) and LR(1) grammars
- Title not available (Why is that?)
- Towards a Taxonomy for ECFG and RRPG Parsing
- Shift-reduce parsers for transition networks
Cited In (4)
This page was built for publication: Fast deterministic parsers for transition networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789065)
