Even faster generalized LR parsing
From MaRDI portal
Recommendations
Cited in
(21)- On regular tree languages and deterministic pushdown automata
- Generation of efficient LALR parsers for regular right part grammars
- Reducing non-determinism in right nulled GLR parsers
- Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy
- Generalized LR parsing algorithm for grammars with one-sided contexts
- BRNGLR: a cubic Tomita-style GLR parsing algorithm
- Evaluating GLR parsing algorithms
- Recognition is not parsing - SPPF-style parsing from cubic recognisers
- DynGenPar -- a dynamic generalized parser for common mathematical language
- scientific article; zbMATH DE number 53315 (Why is no real title available?)
- scientific article; zbMATH DE number 57113 (Why is no real title available?)
- scientific article; zbMATH DE number 1956468 (Why is no real title available?)
- scientific article; zbMATH DE number 2087566 (Why is no real title available?)
- scientific article; zbMATH DE number 7453089 (Why is no real title available?)
- Compiler Construction
- Compiler Construction
- scientific article; zbMATH DE number 2202218 (Why is no real title available?)
- GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
- Practical optimization of LR(1) parsers
- A predictive bottom-up parser
- Parallel \(LL\) parsing
This page was built for publication: Even faster generalized LR parsing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941744)