Sciweavers

107 search results - page 18 / 22
» Higher-Order Attribute Grammars
Sort
View
ACL
1993
13 years 8 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
ACL
1992
13 years 8 months ago
Recognition of Linear Context-Free Rewriting Systems
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...
Giorgio Satta
ENTCS
2008
105views more  ENTCS 2008»
13 years 7 months ago
Development of a Modelica Compiler Using JastAdd
This paper describes experiences from implementing key parts of a compiler for Modelica, an object-oriented language supporting declarative modeling and simulation of complex phys...
Johan Åkesson, Torbjörn Ekman, Gör...
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 5 months ago
A Categorical Outlook on Cellular Automata
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...
Silvio Capobianco, Tarmo Uustalu
HICSS
2007
IEEE
135views Biometrics» more  HICSS 2007»
14 years 1 months ago
Composable Language Extensions for Computational Geometry: A Case Study
— This paper demonstrates how two different sets of powerful domain specific language features can be specified and deployed as composable language extensions. These extensions...
Eric Van Wyk, Eric Johnson