Skip Navigation

The Computer Journal 1970 13(3):263-271; doi:10.1093/comjnl/13.3.263
© 1970 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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hext, J. B.
Right arrow Articles by Roberts, P. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Syntax analysis by Domölki's algorithm

J. B. Hext1 * and P. S. Roberts2 §

1 Basser Computing Department, School of Physics, University of Sydney, Sydney, Australia, 2 Department of Information Science, Monash University, Clayton, Victoria, Australia

A description and evaluation is given of a syntax analysis algorithm originated by Domölki. It is shown how to construct the logical matrices for representing the B.N.F. syntax and how to extend the algorithm to avoid backtracking. The algorithm is developed further in order to test its own validity when used on a given grammar. The resulting procedure provides a powerful means for detecting the ambiguities of a grammar.

Received September 1969.

* Basser Computing Department, School of Physics, University of Sydney, Sydney, N.S.W. 2006, Australia

§ Department of Information Science, Monash University, Clayton, Victoria 3168, Australia


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.