Paper Info
Title
An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes
Abstract
The infinite tree obtained classically by unfolding the definition of a recursive scheme, contains several identical subtrees. When they are identified, the resulting graph is generated by a deterministic graph grammar, if the scheme is monadic. We show how to extract one such a grammar from the scheme.
Year
DOI
Venue
1990
10.1007/BFb0017390
Graph-Grammars and Their Application to Computer Science
Keywords
Field
DocType
context-free grammar,graph grammars,deterministic graph grammar.,recursive program scheme,context free grammar
Context-sensitive grammar,Tree-adjoining grammar,Attribute grammar,Discrete mathematics,Context-free grammar,Regular tree grammar,Computer science,Theoretical computer science,Null graph,Parsing expression grammar,Voltage graph
Conference
ISBN
Citations 
PageRank 
3-540-54478-X
0
0.34
References 
Authors
13
1
Name
Order
Citations
PageRank
Didier Caucal147039.15