Publication date
August 2007
DOIAbstract
In this report a modification to a BURS algorithm is presented. With this modification we have a nearly linear run-time instead of a the exponentiell run-time
In this report a modification to a BURS algorithm is presented. With this modification we have a nearly linear run-time instead of a the exponentiell run-time
AbstractWe consider the problem of linear regular tree pattern matching and describe a new solution ...
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules...
We prove a general purpose abstract Church-Rosser result that captures most existing such results th...
A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to...
. BURS theory provides a powerful mechanism to efficiently generate pattern matches in a given expre...
BURS theory provides a powerful mechanism to efficiently generate pattern matches in a given express...
BURS theory provides a powerful mechanism to efficiently generate pattern matches in a given express...
A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to...
AbstractAutomatic code generators often contain pattern matchers that are based on tree grammars. In...
Automatic code generators often contain pattern matchers that are based on tree grammars. In this wo...
A term rewrite system is used to specify a pattern matcher in a code generator. The pattern matcher ...
AbstractAutomatic code generators often contain pattern matchers that are based on tree grammars. In...
1 Overv iew BURG is a program that generates a fast tree parser using BURS (Bottom-Up Rewrite System...
AbstractGeneration of labelled transition systems from system specifications is highly dependent on ...
In normalization, traversing the term to find a match with a rule costs most of the time. This thesi...
AbstractWe consider the problem of linear regular tree pattern matching and describe a new solution ...
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules...
We prove a general purpose abstract Church-Rosser result that captures most existing such results th...
A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to...
. BURS theory provides a powerful mechanism to efficiently generate pattern matches in a given expre...
BURS theory provides a powerful mechanism to efficiently generate pattern matches in a given express...
BURS theory provides a powerful mechanism to efficiently generate pattern matches in a given express...
A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to...
AbstractAutomatic code generators often contain pattern matchers that are based on tree grammars. In...
Automatic code generators often contain pattern matchers that are based on tree grammars. In this wo...
A term rewrite system is used to specify a pattern matcher in a code generator. The pattern matcher ...
AbstractAutomatic code generators often contain pattern matchers that are based on tree grammars. In...
1 Overv iew BURG is a program that generates a fast tree parser using BURS (Bottom-Up Rewrite System...
AbstractGeneration of labelled transition systems from system specifications is highly dependent on ...
In normalization, traversing the term to find a match with a rule costs most of the time. This thesi...
AbstractWe consider the problem of linear regular tree pattern matching and describe a new solution ...
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules...
We prove a general purpose abstract Church-Rosser result that captures most existing such results th...
Add to ORKG