Loading...
Please wait, while we are loading the content...
Similar Documents
Viability of a Parsing Algorithm for Context-sensitive Graph Grammars (1996)
| Content Provider | CiteSeerX |
|---|---|
| Researcher | Vermeulen, Jeroen |
| Abstract | Graph Grammars describe formal languages similar to the textual ones commonly used to define computer languages, but their productions operate on graphs instead of on text. They are contextsensitive when productions rewrite patterns of symbols rather than single symbols. Parsing such grammars is inherently very hard because among other reasons, the input is not sequential in nature. An algorithm for parsing a large class of context-sensitive graph grammars has been developed by Jan Rekers and Andy Schurr. This thesis describes a first implementation of this algorithm as well as several improvements, additional work, examples, theory of operation and performance characteristics. Future and existing optimizations are discussed. 1 Introduction 1.1 Graph Grammars Although formal grammars are commonly used in computer science for the description of textual languages, relatively little progress has as yet been made towards understanding and implementing visual languages. A visual languag... |
| File Format | |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Formal Grammar Visual Language Visual Languag Parsing Algorithm First Implementation Andy Schurr Large Class Formal Language Computer Language Graph Grammar Additional Work Several Improvement Single Symbol Context-sensitive Graph Grammar Computer Science Textual Language Jan Rekers Textual One Performance Characteristic Little Progress |
| Content Type | Text |
| Resource Type | Thesis |
