We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
We investigate the potential of Tree Substitution Grammars as a source of features for native language detection, the task of inferring an author’s native language from text in ...
The accessible specification of performance queries is a key challenge in performance analysis. To this end, we seek to combine the intuitive aspects of natural language query spec...
Lei Wang 0002, Nicholas J. Dingle, William J. Knot...
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...