Access Restriction

Author Visser, Eelco
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Parse Forest ♦ Efficient Lr-like ♦ Main Result ♦ Ambiguous Sentence ♦ Declarative Description ♦ Disambiguation Method ♦ Parse Tree ♦ Practical Application ♦ Ambiguous Grammar ♦ Highlevel Description ♦ Possible Parse Tree ♦ Disambiguation Filter ♦ Context-free Grammar Enable Concise Specification ♦ Case Study ♦ Optimizing Parsing Schema
Description Proceedings Accolade95
Disambiguation methods for context-free grammars enable concise specification of programming languages by ambiguous grammars. A disambiguation filter is a function that selects a subset from a set of parse trees---the possible parse trees for an ambiguous sentence. The framework of filters provides a declarative description of disambiguation methods independent of parsing. Although filters can be implemented straightforwardly as functions that prune the parse forest produced by some generalized parser, this can be too inefficient for practical applications. In this paper the optimization of parsing schemata, a framework for highlevel description of parsing algorithms, by disambiguation filters is considered in order to find efficient parsing algorithms for declaratively specified disambiguation methods. As a case study the optimization of the parsing schema of Earley's parsing algorithm by two filters is investigated. The main result is a technique for generation of efficient LR-like p...
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article