28 search results - page 4 / 6 » Polytypic Syntax Tree Operations |
ECAI
1990
Springer
13 years 11 months ago
1990
Springer
Much recent work in computational morphology has presupposed that morphological operations are de nable on strings of phonological or graphemic objects. By contrast, theoretical l...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
ITSSA
2006
13 years 7 months ago
2006
: This article proposes a new method for creating test software for object-oriented systems using a genetic programming approach. It is believed that this approach is advantageous ...
AMAST
1998
Springer
13 years 12 months ago
1998
Springer
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
ICFP
2001
ACM
14 years 7 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...