| Mikkel Thorup. Controlled grammatic ambiguity. ACM Transactions on Programming Languages and Systems, 16(3):1024--1050, May 1994. |
....Methods Disambiguation by priorities as defined in this section originally defined in [HHKR92] Disambiguation by priority conflicts is similar to the methods using precedences as in [Ear75, AJU75] In [KV94] several disambiguation methods are defined using filters. Subtree exclusion [Tho94] is a disambiguation method that works by specifying a finite set of partial parse trees that are forbidden as subtrees of parse trees yielded by the parser. This method allows a more fine tuned disambiguation than is achievable by the priority scheme. Examples are disambiguation of generic ....
Mikkel Thorup. Controlled grammatic ambiguity. ACM Transactions on Programming Languages and Systems, 16(3):1024--1050, May 1994.
....binary operators that have non overlapping operator syntax to solve shift reduce conflicts in LR tables. The method is based on observations on how such conflicts should be solved given precedence information, without a real understanding of the cause of the conflicts. In a recent paper Thorup [Tho94a] describes a method that tries to find a consistent solution for all conflicts in an LR table starting from, and producing a set of excluded subtrees. Both methods fail on grammars that are inherently non LR(k) i.e. for which there is no complete solution of all conflicts in any LR table for the ....
Mikkel Thorup. Controlled grammatic ambiguity. ACM Transactions on Programming Languages and Systems, 16(3):1024--1050, May 1994.
No context found.
Mikkel Thorup. Controlled grammatic ambiguity. ACM Transactions on Programming Languages and Systems, 16(3):1024--1050, May 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC