Analyzing ambiguity of context-free grammars

DOI10.1016/J.SCICO.2009.11.002MaRDI QIDQ2266946zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

approximationcontext-free languagesbiosequence analysis

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Analyzing Ambiguity of Context-Free Grammars
• Tracking down the origins of ambiguity in context-free grammars
• A note on ambiguity in context-free grammars
• Conservative Ambiguity Detection in Context-Free Grammars
• Context-free ambiguity detection using multi-stack pushdown automata

Cites work

• scientific article; zbMATH DE number 1615269 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1216248 (Why is no real title available?)
• scientific article; zbMATH DE number 2087485 (Why is no real title available?)
• scientific article; zbMATH DE number 2087566 (Why is no real title available?)
• scientific article; zbMATH DE number 2090837 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• scientific article; zbMATH DE number 3307588 (Why is no real title available?)
• scientific article; zbMATH DE number 3361265 (Why is no real title available?)
• A characterization of parenthesis languages
• A discipline of dynamic programming over sequence data
• An efficient context-free parsing algorithm
• An experimental ambiguity detection tool
• Biological Sequence Analysis
• Compiler Construction
• Conservative Ambiguity Detection in Context-Free Grammars
• Database Programming Languages
• Detection of Generative Ambiguities in Context-Free Mechanical Languages
• LR-regular grammars - an extension of LR(k) grammars
• On The Ambiguity Problem of Backus Systems
• On the translation of languages from left to right
• Optimization of LR(k) parsers
• Regular approximation of context-free grammars through transformation
• The metafront system: safe and extensible parsing and transformation

Cited in

(14)

• Context-free ambiguity detection using multi-stack pushdown automata
• 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
• scientific article; zbMATH DE number 3896326 (Why is no real title available?)
• Equivalent conversions of ambiguous context-free grammars
• A note on ambiguity in context-free grammars
• Analyzing Ambiguity of Context-Free Grammars
• An ambiguity hierarchy of weighted context-free grammars
• Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
• Analyzing Context-Free Grammars Using an Incremental SAT Solver
• Algebraic dynamic programming on trees

Describes a project that uses

Uses Software

• XSugar
• Locomotif
• Infernal
• dk.brics.automaton
• Rfam
• Elkhound

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)