Parsing Key Word Grammars
| dc.date.accessioned | 2004-10-01T20:50:10Z | |
| dc.date.accessioned | 2018-11-24T10:10:55Z | |
| dc.date.available | 2004-10-01T20:50:10Z | |
| dc.date.available | 2018-11-24T10:10:55Z | |
| dc.date.issued | 1969-03-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5865 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/5865 | |
| dc.description.abstract | Key word grammars are defined to be the same as context free grammars, except that a production may specify a string of arbitrary symbols. These grammars define languages similar to those used in the programs CARPS and ELIZA. We show a method of implementing the LR9k) parsing algorithm for context free grammars which can be modified slightly in order to parse key word grammars. When this is done algorithm can use many of the techniques used in ELIZA parse. Therefore, the algorithm helps to show the relation between the classical parsers and key word parsers. | en_US |
| dc.format.extent | 15 p. | en_US |
| dc.format.extent | 5622471 bytes | |
| dc.format.extent | 386528 bytes | |
| dc.language.iso | en_US | |
| dc.title | Parsing Key Word Grammars | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-184.pdf | 386.5Kb | application/pdf | View/ |
| AIM-184.ps | 5.622Mb | application/postscript | View/ |