Solving Regular Tree Grammar Based Constraints
No abstract available.
DOI 10.1007/3-540-47764-0_13
Related papers
- Synthesizing DSLs for Few-Shot Learning OOPSLA 2025
- Static Inference of Regular Grammars for Ad Hoc Parsers OOPSLA 2025
- Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints CAV 2009
- Computing repair alternatives for malformed programs using constraint attribute grammars OOPSLA 2016
- Tree Buffers CAV 2015
- Efficient static analysis of XML paths and types PLDI 2007
- Tool Paper: AGTix: Concise Use of Scope Graphs in Reference Attribute Grammars SLE 2026
- Polymorphic regular tree types and patterns POPL 2006