Parsing Key Word Grammars
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 f...
Main Author: | Martin, William |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/5865 |
Similar Items
-
Tunnel Parsing with Ambiguous Grammars
by: Handzhiyski Nikolay, et al.
Published: (2023-06-01) -
Grammar-Based Specification and Parsing of Binary File Formats
by: William Underwood
Published: (2012-03-01) -
Grammar-Based Specification and Parsing of Binary File Formats
by: William Underwood
Published: (2012-03-01) -
Grammar-Based Specification and Parsing of Binary File Formats
by: William Underwood
Published: (2012-03-01) -
Grammar-Based Specification and Parsing of Binary File Formats
by: William Underwood
Published: (2012-03-01)