An experimental ambiguity detection tool
From MaRDI portal
Publication:2653935
Recommendations
Cites work
- An efficient context-free parsing algorithm
- Analyzing Ambiguity of Context-Free Grammars
- Compiler Construction
- Conservative Ambiguity Detection in Context-Free Grammars
- Deterministic parsing of ambiguous grammars
- Extending lookahead for LR parsers
- Graphes canoniques de graphes algébriques
- scientific article; zbMATH DE number 986407 (Why is no real title available?)
- scientific article; zbMATH DE number 5277949 (Why is no real title available?)
- scientific article; zbMATH DE number 46118 (Why is no real title available?)
- scientific article; zbMATH DE number 2087566 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3361265 (Why is no real title available?)
- LR-regular grammars - an extension of LR(k) grammars
- Noncanonical Extensions of Bottom-Up Parsing Techniques
- Noncanonical LALR(1) Parsing
- Noncanonical SLR(1) Grammars
- On LL-regular grammars
- On The Ambiguity Problem of Backus Systems
- Optimization of LR(k) parsers
- Reducing non-determinism in right nulled GLR parsers
- Regular approximation of context-free grammars through transformation
- Semi-automatic grammar recovery
- Tests for the LR-, LL-, and LC-regular conditions
- The size of LALR (1) parsers
Cited in
(4)
This page was built for publication: An experimental ambiguity detection tool
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2653935)