Results 1 
3 of
3
Using Filters for the Disambiguation of Contextfree Grammars
 Proc. ASMICS Workshop on Parsing Theory
, 1994
"... An ambiguous contextfree grammar defines a language in which some sentences have multiple interpretations. For conciseness, ambiguous contextfree grammars are frequently used to define even completely unambiguous languages and numerous disambiguation methods exist for specifying which interpretatio ..."
Abstract

Cited by 29 (11 self)
 Add to MetaCart
An ambiguous contextfree grammar defines a language in which some sentences have multiple interpretations. For conciseness, ambiguous contextfree grammars are frequently used to define even completely unambiguous languages and numerous disambiguation methods exist for specifying which interpretation is the intended one for each sentence. The existing methods can be divided in `parser specific' methods that describe how some parsing technique deals with ambiguous sentences and `logical' methods that describe the intended interpretation without reference to a specific parsing technique. We propose a framework of filters to describe and compare a wide range of disambiguation problems in a parserindependent way. A filter is a function that selects from a set of parse trees (the canonical representation of the interpretations of a sentence) the intended trees. The framework enables us to define several general properties of disambiguation methods. The expressive power of filters is illust...
Lemma 16.2
, 1993
"... urned by Algorithm B. Proof: The result is trivial if t 0 = t 1 , for then also t 0 0 = t 0 1 , so the projection of (t 0 0 ; t 0 1 ) is ?, which is returned in step B.1 Thus we may assume that t 0 6= t 1 . Notice that this does not in general imply t 0 0 6= t 0 1 . However, if t 0 0 ..."
Abstract
 Add to MetaCart
urned by Algorithm B. Proof: The result is trivial if t 0 = t 1 , for then also t 0 0 = t 0 1 , so the projection of (t 0 0 ; t 0 1 ) is ?, which is returned in step B.1 Thus we may assume that t 0 6= t 1 . Notice that this does not in general imply t 0 0 6= t 0 1 . However, if t 0 0 6= t 0 1 and a 0\Gamma is the longest common prefix of the action sequences of t 0 0 and t 0 1 , then state(t 0 ; ja 0\Gamma j) = state(t 1<F13.