Abstract
As M. Tomita [5] has demonstrated, the LR parsing algorithm can be extended so that it will handle acyclic context-free grammars in a very efficient way, producing a parse forest, a set of all possible parsing trees for a given input sentence. In this paper we aim to show how Tomita's parsing algorithm can be extended to support semantic actions, that is, procedural segments associated with grammar production rules, that are executed contextually during the parsing procedure.Key wordscomputational linguisticscontext-free grammarsparallel parsingsemantic actions
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
