Electronic Resource
Springer
International journal of parallel programming
12 (1983), S. 1-11
ISSN:
1573-7640
Keywords:
Trees
;
regular expressions
;
expansive tree grammars
;
regularity-preserving transformations
;
context-free languages
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract Regular-like expressions provide a compact notation for the explicit description of context-free languages. In this paper we extend these concepts by establishing a one-to-one correspondence between expansive tree languages and regular-like sets of trees. Algorithms are developed for constructing an expansive tree grammar whose language is defined by a given regular-like tree (RLT) expression, and vice versa. These results are then used to obtain RLT equations that describe sets of tree resulting from regularity-preserving transformations associated with three types of errors commonly found in practice.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00996800
Permalink
|
Location |
Call Number |
Expected |
Availability |
