Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata
From MaRDI portal
Publication:2817371
DOI10.1007/978-3-662-53132-7_1zbMath1436.68158OpenAlexW2494701561MaRDI QIDQ2817371
Hendrikus (Bas) Joseph Sebastiaan Basten
Publication date: 30 August 2016
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/25147
Cites Work
- Budget-bounded model-checking pushdown systems
- Analyzing ambiguity of context-free grammars
- Bracketed context-free languages
- Top-down syntax nalysis
- Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
- Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
- Analyzing Context-Free Grammars Using an Incremental SAT Solver
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
- Tracking Down the Origins of Ambiguity in Context-Free Grammars
- Tools and Algorithms for the Construction and Analysis of Systems
- Conservative Ambiguity Detection in Context-Free Grammars
- Detection of Generative Ambiguities in Context-Free Mechanical Languages
- On the translation of languages from left to right
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata
