Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5865| Title: | Parsing Key Word Grammars |
| Issue Date: | 9-Oct-2013 |
| Description: | 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. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | AIM-184 http://hdl.handle.net/1721.1/5865 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.