On the parsing and covering of simple chain grammars


Share/Save/Bookmark

Nijholt, Anton (1978) On the parsing and covering of simple chain grammars. In: Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17–21, 1978. Springer Verlag, Berlin, pp. 330-344. ISBN 9783540088608

open access
[img]
Preview
PDF
583kB
Abstract:A method is presented for obtaining a simple deterministic pushdown transducer which acts as a parser for simple chain grammars. It is shown that a simple deterministic grammar can be constructed which covers the simple chain grammar. To obtain both the simple deterministic pushdown transducer and the cover result, a new type of parse is introduced which differs from the left and right parses which are common for the usual one pass no back-tracking parsing algorithms. For the simple chain grammars this parse, the so-called left part parse, follows from a simple left part property which is satisfied by the grammatical trees of simple chain grammars.
Item Type:Book Section
Copyright:© 1978 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66790
Official URL:http://dx.doi.org/10.1007/3-540-08860-1_24
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page