Transition Diagram Systems and Normal Form Algorithms (1998)
| Citations: | 1 - 1 self |
BibTeX
@MISC{Giammarresi98transitiondiagram,
author = {Dora Giammarresi and Derick Wood},
title = {Transition Diagram Systems and Normal Form Algorithms},
year = {1998}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We investigate the complexity of a variety of normal-form transformations for transition diagram systems, which are a parsing view of extended context-free grammars. A transition diagram system is a finite collection of finite-state machines each of which is labeled with a unique nonterminal symbol. The study is motivated by the implementation project GraMa which will provide a C++ toolkit for the symbolic manipulation of context-free objects just as Grail does for regular objects. 1 Introduction In the 1960's, extended context-free grammars (as Backus--Naur form) were introduced as a useful abbreviatory notation that made context-free grammars easier to write. More recently, the Standardized General Markup Language (SGML) [17] used a similar abbreviatory notation to define extended context-free grammars for documents. Currently, XML [4], which is a simplified version of SGML, is being promoted as the markup language for the web, instead of HTML (a specific grammar or DTD specified us...
