Analyzing ambiguity of context-free grammars

DOI10.1016/j.scico.2009.11.002zbMath1189.68068DBLPjournals/scp/BrabrandGM10OpenAlexW2988158430WikidataQ56387032 ScholiaQ56387032MaRDI QIDQ2266946

Robert Giegerich, Claus Brabrand, 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)

Related Items (3)

Algebraic dynamic programming on trees ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity ⋮ Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata

Uses Software

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

Cites Work

• The metafront system: safe and extensible parsing and transformation
• A discipline of dynamic programming over sequence data
• LR-regular grammars - an extension of LR(k) grammars
• Optimization of LR(k) parsers
• 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
• An efficient context-free parsing algorithm
• A characterization of parenthesis languages
• On the translation of languages from left to right
• On The Ambiguity Problem of Backus Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing ambiguity of context-free grammars