Kuo-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295--320, Oct 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....c to be the leftmost substring with this property, a restriction that is often included in the definition of handle because LR(k) paxsing, called canonical paxsing , is the main paxsing technique under consideration. Our definition is less restrictive allowing non canonical paxsing techniques[18, 19]. A derivation of a sentential form can be reconstructed by successively identifying a handle of aar and replacing the substring c by A to yield saw until no more handles axe left. This process is called handle pruning. Grammaxs for programming languages axe usually de signed to map ....

.... , if, given any sentential form, it is possible to identify at least one handle of the sentential form looking at j symbols to the left and k symbols to the right of the handle (for some finite j and k) BCP(j, k) Grammaxs were introduced by Williams[21] and studied extensively in the 1970 s[17, 18, 19]. An interesting subclass of BCP grammaxs is the class of Bounded Right Context grammaxs[9] basically the intersection of LR(k) and BCP(j, k) This class of grammaxs is laxge enough to generate all deterministic languages but does still allow for fast lineax paxsing algorithms[10] 16] The class ....

Kuo-Chung Tai. Noncanonical SLR(1) grammaxs. ACM Transactions on Programming Languages and Systems, 1(2):295-320, 1979.

....the stream at any given point. The e#ect of this modification is that under certain conditions, nonterminals as well as terminals can be used in lookahead decisions. 93 6.3. 1 NSLR(1) The only noncanonical bottom up algorithm that is known to be practical is the NSLR(1) algorithm created by Tai [22]. The following example CFG by Tai expresses the language c n 0 d n 0 , which is not LR(k) for any k but is NSLR(1) a B a E B a B B a F B B B However, this grammar is also indicative of the limitations of the algorithm: if the seemingly redundant ....

Kuo-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295--320, Oct 1979.

....impractical to rely on backtracking as a substitute for prediction or to integrate lexical analysis with parsing. The only prior known linear time parsing algorithm that effectively supports integrated lexical analysis, or scannerless parsing, is the NSLR(1) algorithm originally created by Tai [19] and put into practice for this purpose by Salomon and Cormack [18] This algorithm extends the traditional LR class of algorithms by adding limited support for making lookahead decisions based on nonterminals. The relative power of packrat parsing with respect to NSLR(1) is unclear: packrat ....

Kuo-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295--320, Oct 1979.

....and its complexity is O(n 3 ) In contrast, the parser we are developing here results from the layering of the grammar rules in a preprocessing phase, set no restrictions of the form of specification rules, and its complexity is linear with the length of the input. In this paper a noncanonical [27] approach to parsing is presented. Its overall goal is to recognize any valid phrase represented by the entire input stream, and to do so in distributed fashion by recognizing the individual subphrase [4] components of that phrase. This represents a vertical fragmentation of the overall parsing ....

....loosely coupled and pipelined in contrast with conventional designs having tightly coupled lexical and syntax stages. The parsing algorithm presented in this paper is a simplified noncanonical SLR parser [7] which while keeping all the virtues of the noncanonical NSLR algorithm developed by Tai [27] avoids all its difficulties by handling conflict resolution as follows: 1. The language analysis system, Las, 22] preprocesses the specification grammar and for each production r of the form A ff computes the context C(r) and the noncontext N (r) which are sets of pairs of strings with the ....

[Article contains additional citation context not shown here]

K.C. Tai. Noncanonical slr(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295--320, 1979.

No context found.

Kuo-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295--320, Oct 1979.

No context found.

Kuo-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295--320, Oct 1979.

No context found.

Kuo-Chung Tai. Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems, 1(2):295--320, 1979. ISSN 0164-0925. doi: 10.1145/357073.357083.

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