Analyzing Context-Free Grammars Using an Incremental SAT Solver

DOI10.1007/978-3-540-70583-3_34MaRDI QIDQ3519518zbMATH OpenOpenAlexWikidataFDO

Authors Roland Axelsson, Keijo Heljanko, Martin Lange

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

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

Recommendations

• Automatic evaluation of context-free grammars (system description)
• Analyzing ambiguity of context-free grammars
• Analyzing Ambiguity of Context-Free Grammars
• Complete SAT-Based Model Checking for Context-Free Processes
• Verified Decision Procedures on Context-Free Grammars

Cites work

• Analyzing Ambiguity of Context-Free Grammars
• Conservative Ambiguity Detection in Context-Free Grammars
• Decomposing Global Grammar Constraints
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3254900 (Why is no real title available?)
• LR-regular grammars - an extension of LR(k) grammars
• Recognition and parsing of context-free languages in time n3

Cited in

(6)

• A complete refinement procedure for regular separability of context-free languages
• Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
• Context-free ambiguity detection using multi-stack pushdown automata
• Verified Decision Procedures on Context-Free Grammars
• Automatic evaluation of context-free grammars (system description)
• Symbolic encoding of LL(1) parsing and its applications

Describes a project that uses

Uses Software

• Chaff

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

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