scientific article; zbMATH DE number 194074
From MaRDI portal
Publication:4040864
Recommendations
Cited in
(41)- Producing the left parse during bottom-up parsing
- A Yacc extension for LRR grammar parsing
- SLR(1) and LALR(1) parsing for unrestricted grammars
- Looping LR parsers
- Semantic routines and \(LR(k)\) parsers
- Recursive ascent parsing: From Earley to Marcus
- LR(k)-coupled-context-free grammars
- The validation of SGML content models
- On the size of parsers and \(\text{LR}(k)\)-grammars
- Size/lookahead tradeoff for \(LL(k)\)-grammars
- An LR parser with pre-determined reduction goals
- On the prediction of reduction goals: A deterministic approach
- Truly prefix-correct chain-free LR(1) parsers
- Some observations on LR-like parsing with delayed reduction
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- scientific article; zbMATH DE number 3843162 (Why is no real title available?)
- On the correct elimination of chain productions from lr parsers
- scientific article; zbMATH DE number 3856438 (Why is no real title available?)
- scientific article; zbMATH DE number 3860423 (Why is no real title available?)
- LR parsing for global index languages (GILs)
- Noncanonical LALR(1) Parsing
- scientific article; zbMATH DE number 3915654 (Why is no real title available?)
- A short proof of a conjecture of De Remer and Pennello
- scientific article; zbMATH DE number 4033120 (Why is no real title available?)
- scientific article; zbMATH DE number 4033121 (Why is no real title available?)
- SL parses the LR languages
- A general model for fixed look-ahead lr parsers
- scientific article; zbMATH DE number 4100631 (Why is no real title available?)
- scientific article; zbMATH DE number 193480 (Why is no real title available?)
- scientific article; zbMATH DE number 2050923 (Why is no real title available?)
- Grammar partitioning and modular deterministic 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
- Complexity of extended vs. classic LR parsers
- Yet another generation of LALR parsers for regular right part grammars
- On parsing LL-languages
- On the reduction of \(LR(k)\) parsers
- An improved LALR\((k)\) parser generation for regular right part grammars
- On the complexity of LL(k) testing
- LR error repair using the A* algorithm
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 Q4040864)