Analyzing Ambiguity of Context-Free Grammars

DOI10.1007/978-3-540-76336-9_21zbMath1139.68348OpenAlexW2047709539MaRDI QIDQ3503908

Claus Brabrand, Anders Møller, Robert Giegerich

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.3118

zbMATH Keywords

regular approximationCFG ambiguityRNA analysis

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Grammars and rewriting systems (68Q42)

Related Items (5)

The most probable annotation problem in HMMs and its application to bioinformatics ⋮ An experimental ambiguity detection tool ⋮ Analyzing Ambiguity of Context-Free Grammars ⋮ Analyzing Context-Free Grammars Using an Incremental SAT Solver ⋮ XML graphs in program analysis

Cites Work

• A discipline of dynamic programming over sequence data
• LR-regular grammars - an extension of LR(k) grammars
• Optimization of LR(k) parsers
• Analyzing Ambiguity of Context-Free Grammars
• Biological Sequence Analysis
• Compiler Construction
• Conservative Ambiguity Detection in Context-Free Grammars
• Database Programming Languages
• Detection of Generative Ambiguities in Context-Free Mechanical Languages
• On the translation of languages from left to right
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analyzing Ambiguity of Context-Free Grammars