Sciweavers

359 search results - page 34 / 72
» Reference Attributed Grammars
Sort
View
ACL
1992
13 years 11 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
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 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 4 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
LOPSTR
2001
Springer
14 years 2 months ago
On Deforesting Parameters of Accumulating Maps
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...
Kazuhiko Kakehi, Robert Glück, Yoshihiko Futa...
ENTCS
2002
131views more  ENTCS 2002»
13 years 9 months ago
Automatic Generation of Language-based Tools
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...
Pedro Rangel Henriques, Maria João Varanda ...