T. Schultzke. Concepts and Implementation of a Parser for Visual Languages. Master's thesis (in German), TU Berlin, Germany, 2001.  Home/Search   Document Not in Database   Summary   Related Articles

....Layered Graph Grammars (CLGGs) was developed [2] which support vertex embedding, NACs, and complex predicates. This approach includes the de nition of layering conditions guaranteeing termination of the parsing process. Furthermore, static analysis techniques like critical pair analysis [10,9,12] are available which can be exploited to identify a maximum set of rules which may be parsed without any need for backtracking. VLCC [3] and DiaGen [8] use restricted context sensitive rules to parse VLs. This kind of rules is successfully applied to rather simple languages but 1 Research ....

....to the rule layer) to a given terminal graph always terminates. Roughly speaking, the layering condition is ful lled if each rule deletes at least one vertex or edge coming from a lower level (deletion layer) and creates graph objects of a higher level (creation layer) Critical pair analysis [10,9,12] can be used to make parsing by graph transformation more ecient: decisions between con icting rule applications are delayed as far as possible. This means to apply non con icting rules rst and to reduce the graph as much as possible. Afterwards, rule application con icts are handled by creating ....

T. Schultzke. Concepts and Implementation of a Parser for Visual Languages. Master's thesis (in German), TU Berlin, Germany, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC