Conservative Ambiguity Detection in Context-Free Grammars

DOI10.1007/978-3-540-73420-8_60zbMath1171.68518OpenAlexW2163032283MaRDI QIDQ5428850

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)

Related Items (6)

An experimental ambiguity detection tool ⋮ Analyzing Ambiguity of Context-Free Grammars ⋮ Analyzing Context-Free Grammars Using an Incremental SAT Solver ⋮ Analyzing ambiguity of context-free grammars ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity ⋮ Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata

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