|
ABSTRACT
Bounded context parsing was first introduced by Floyd and Graham in which they used a precedence parsing method. However, precedence parsing has some drawbacks such as the parser is often very large and not all languages are precedence parsable.Another technique for generating a Bounded Context Parser was developed by Mickunas at Purdue University. This technique, which is often referred to as Bounded Context Acceptor (BCA) or Extended Bounded Context Acceptor (EBCA), can generate a more compact parser.This paper introduces a new parsing method which is derived from EBCA. The parse table generated by this method is much smaller than those generated by EBCA. The parsing technique yields similiar or improved efficiency when compared to EBCA.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
| |
3
|
Graham, S. L. "On Bounded Right Context Languages and Grammars," SIAM J. Comput. 3(1974), 224-254.
|
| |
4
|
Graham, R. M. "Bounded Context Translation," AFIPS. Vol 25, p.p. 17-29, 1964.
|
| |
5
|
|
 |
6
|
|
 |
7
|
M. D. Mickunas , R. L. Lancaster , V. B. Schneider, Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars, Journal of the ACM (JACM), v.23 n.3, p.511-533, July 1976
[doi> 10.1145/321958.321972]
|
| |
8
|
|
| |
9
|
Schell, R. M. "A Method for Constructing Compressed Parsers for a Parser Generating System," Master's Thesis, University of Illinois, 1976.
|
|