Conservative Ambiguity Detection in Context-Free Grammars

DOI10.1007/978-3-540-73420-8_60MaRDI QIDQ5428850zbMATH OpenOpenAlexFDO

Authors Sylvain Schmitz

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_60

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

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

Cited in

(8)

• Analyzing ambiguity of context-free grammars
• An experimental ambiguity detection tool
• Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
• Context-free ambiguity detection using multi-stack pushdown automata
• Analyzing Ambiguity of Context-Free Grammars
• Analyzing Context-Free Grammars Using an Incremental SAT Solver
• Tracking down the origins of ambiguity in context-free grammars
• Consistency of stochastic context-free grammars

This page was built for publication: Conservative Ambiguity Detection in Context-Free Grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428850)