Fast deterministic parsers for transition networks
From MaRDI portal
Publication:1789065
Recommendations
Cites work
- scientific article; zbMATH DE number 3671642 (Why is no real title available?)
- scientific article; zbMATH DE number 3584897 (Why is no real title available?)
- scientific article; zbMATH DE number 5254145 (Why is no real title available?)
- scientific article; zbMATH DE number 3254902 (Why is no real title available?)
- A note on a proposed LALR parser for extended context-free grammars
- A simple realization of LR-parsers for regular right part grammars
- Characterization of extended \(\mathrm{LR}(k)\) grammars
- Complexity of extended vs. classic LR parsers
- Constructing LR parsers for regular right part grammars
- Design of a separable transition-diagram compiler
- Formal languages and compilation
- Iterating iterated substitution
- LALR(1,1) parser generation for regular right part grammars
- On the definition of ELR(k) and ELL(k) grammars
- On the relationship between LL(1) and LR(1) grammars
- On the translation of languages from left to right
- Pascal. User manual and report. 2nd ed
- Properties of deterministic top-down grammars
- Shift-reduce parsers for transition networks
- Top-down syntax nalysis
- Towards a Taxonomy for ECFG and RRPG Parsing
- Yet another generation of LALR parsers for regular right part grammars
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)
