Analyzing Context-Free Grammars Using an Incremental SAT Solver

DOI10.1007/978-3-540-70583-3_34zbMath1155.68408OpenAlexW1489411336WikidataQ56387030 ScholiaQ56387030MaRDI QIDQ3519518

Martin Lange, Keijo Heljanko, Roland Axelsson

Publication date: 19 August 2008

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

A complete refinement procedure for regular separability of context-free languages ⋮ Symbolic encoding of LL(1) parsing and its applications ⋮ 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

• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• LR-regular grammars - an extension of LR(k) grammars
• Analyzing Ambiguity of Context-Free Grammars
• Decomposing Global Grammar Constraints
• Conservative Ambiguity Detection in Context-Free Grammars
• Recognition and parsing of context-free languages in time n3

This page was built for publication: Analyzing Context-Free Grammars Using an Incremental SAT Solver