Skip Navigation

The Computer Journal 1976 19(3):229-233; doi:10.1093/comjnl/19.3.229
© 1976 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Henderson, D. S.
Right arrow Articles by Levy, M. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An extended operator precedence parsing algorithm

D. S. Henderson1 * and M. R. Levy2 §

1 Rhodes University, Grahamstown, South Africa, 2 Dept. of Computer Science, University of Waterloo, Waterloo, Canada

Simple precedence and operator precedence parsers for type 2 grammars both have disadvantages. An extended operator precedence method using two types of precedence relations is described. Some conditions on type 2 grammars that are sufficient for the correct operation of a parser of that grammar are shown and verified. An expression analyser using the method is briefly described. The possibility of using the parser as an output generator is discussed.

Received August 1974.

* Present address: Vice-Chancellor, Rhodes University, Grahamstown, South Africa.

§ Present address: Dept. of Computer Science, University of Waterloo, Waterloo, N2L-3G1, Canada.

Department of Applied Mathematics, University of the Witwatersrand, 1 Jan Smuts Avenue, Johannesburg, 2001, South Africa


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.