Skip Navigation

The Computer Journal 1989 32(1):91-93; doi:10.1093/comjnl/32.1.91
© 1989 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 Sideri, M.
Right arrow Articles by Papa-Konstantinou, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Notes

Semantically Driven Parsing of Context-free Languages

M. Sideri *, S. Efremidis * and G. Papa-Konstantinou *

National Technical University of Athens, Department of Electrical Engineering, Computer Science Division, Zografou 157 73, Athens, Greece

An algorithm is presented for the parsing of languages generated by Attribute Grammars in which no restrictions are imposed on the dependencies of the attributes used in parsing decisions.


* National Technical University Of Athens, Department of Electrical Engineering, Computer Science Division, Zografou 157 73, Athens, Greece


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


This article has been cited by other articles:


Home page
 Journal of Information ScienceHome page
R.E. Anderson, P.J. Sallis, and W.K. Yeap
Enhancing a hypertext application using NLP techniques
Journal of Information Science, January 1, 1991; 17(1): 49 - 56.
[Abstract] [PDF]


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.