The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
— This paper demonstrates how two different sets of powerful domain specific language features can be specified and deployed as composable language extensions. These extensions...
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
Many tools have been constructed using different formal methods to process various parts of a language specification (e.g., scanner generators, parser generators and compiler gene...