Journal of Computer and System Sciences
Controlled grammatic ambiguity
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modal logic
Descriptive Approach to Language - Theoretic Complexity
Descriptive Approach to Language - Theoretic Complexity
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A Proof System for Finite Trees
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Toward an engineering discipline for grammarware
ACM Transactions on Software Engineering and Methodology (TOSEM)
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Improved left-corner chart parsing for large context-free grammars
New developments in parsing technology
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
TuLiPA: towards a multi-formalism parsing environment for grammar engineering
GEAF '08 Proceedings of the Workshop on Grammar Engineering Across Frameworks
An Automata-Theoretic Approach to Regular XPath
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
An experimental ambiguity detection tool
Science of Computer Programming
Journal of Logic, Language and Information
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM (JACM)
Pure and declarative syntax definition: paradise lost and regained
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
XPath query satisfiability is in PTIME for real-world DTDs
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
Principled parsing for indentation-sensitive languages: revisiting landin's offside rule
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
Parse trees are fundamental syntactic structures in both computational linguistics and programming language design. We argue in this paper that, in both fields, there are good incentives for model-checking sets of parse trees for some word according to a context-free grammar. We put forward the adequacy of propositional dynamic logic (PDL) on trees in these applications, and study as a sanity check the complexity of the corresponding model-checking problem: although complete for exponential time in the general case, we find natural restrictions on grammars for our applications and establish complexities ranging from nondeterministic polynomial time to polynomial space in the relevant cases.