Analyzing ambiguity of context-free grammars
From MaRDI portal
Publication:2266946
DOI10.1016/J.SCICO.2009.11.002zbMATH Open1189.68068DBLPjournals/scp/BrabrandGM10OpenAlexW2988158430WikidataQ56387032 ScholiaQ56387032MaRDI QIDQ2266946FDOQ2266946
Authors: Claus Brabrand, Robert Giegerich, Anders Møller 
Publication date: 26 February 2010
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2009.11.002
Recommendations
Cites Work
- Compiler Construction
- Database Programming Languages
- Biological Sequence Analysis
- Title not available (Why is that?)
- An efficient context-free parsing algorithm
- Title not available (Why is that?)
- A characterization of parenthesis languages
- Optimization of LR(k) parsers
- A discipline of dynamic programming over sequence data
- On the translation of languages from left to right
- Regular approximation of context-free grammars through transformation
- Title not available (Why is that?)
- The metafront system: safe and extensible parsing and transformation
- LR-regular grammars - an extension of LR(k) grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On The Ambiguity Problem of Backus Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An experimental ambiguity detection tool
- Title not available (Why is that?)
- Conservative Ambiguity Detection in Context-Free Grammars
- Detection of Generative Ambiguities in Context-Free Mechanical Languages
Cited In (14)
- An experimental ambiguity detection tool
- Conservative Ambiguity Detection in Context-Free Grammars
- A note on the expressive power of probabilistic context free grammars
- Tracking down the origins of ambiguity in context-free grammars
- Ambiguity management in grammar writing
- Title not available (Why is that?)
- A note on ambiguity in context-free grammars
- Equivalent conversions of ambiguous context-free grammars
- Analyzing Ambiguity of Context-Free Grammars
- An ambiguity hierarchy of weighted context-free grammars
- Analyzing Context-Free Grammars Using an Incremental SAT Solver
- Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
- Algebraic dynamic programming on trees
- Context-free ambiguity detection using multi-stack pushdown automata
Uses Software
This page was built for publication: Analyzing ambiguity of context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266946)
