D.E. Knuth. On the translation of languages from left to right. Information and Control,8:607--639, 1965. 12  Home/Search   Document Not in Database   Summary   Related Articles   Check

....we have found. In contrast, a traditional LR parser would use the stack to retain this information. We are thus able to reduce reliance on the stack. Our trie has one slight problem, however: it can be infinite in size The set of viable prefixes, and consequently i, is known to be a regular set [13]. Unfortunately, this set will be infinite in all but the most trivial cases. If we had no recursion in the grammar G, then L(G) would be finite and so would i. We induce this situation by introducing limit points at nonterminal symbols in G in such a way as to break the recursire cycles in G. ....

Knuth, D. E. On the Translation of Languages from Left to Right. Information and Control, 8:607-639, 1965.

.... given any sentential form, it is possible to identify all handles 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) BC(j, k) grammars never gained much importance, since shortly after Floyd[9] presented them in 1964, Knuth[12], in 1965, introduced LR(k) grammars and showed how very efficient parsers can be constructed for this larger class of grammars. All BC grammars, however, are continuous and so form an important subclass of continuous grammars. This is proved next. Theorem I BC(j,k) C C PROOF. Assume we axe ....

Donald E. Knuth. On the translation of languages from left to right. Information and Controll, 8:607- 639, 1965.

....to work in linear time for the Boolean closure of the family of deterministic context free languages. Keywords: Conjunctive grammar, parsing, bottom up, LR, generalized LR. 1. Introduction The LR parsing algorithm for deterministic context free languages [1, 2, 12] was introduced by Knuth in [7]. It was actually the rst ecient algorithm to handle a suciently wide subclass of contextfree grammars wide enough to describe the syntax of most of the arti cial languages that one will generally need to parse. The linear time complexity of this algorithm and the general simplicity of its ....

D. E. Knuth, \On the translation of languages from left to right", Information and Control, 11 (1967), 269-289.

....shifted on to the stack (if it s an odd occurrence) and reduced to C (if it s an even occurrence) x must be reduced to A if it s preceeded by C on the stack, and to B if preceeded by a ( There is no need to maintain state information externally. Every LR grammar has an equivalent BRC grammar [12, 20]. In the context of logic programming, the advantage of this simpli cation of LR parsing is that it facilitates the formulation of deterministic bottom up parsing as deterministic proof search. Instead of implementing general LR parsing algorithms by brute force, a process that destroys much of ....

D. E. Knuth. On the translation of languages from left to right. Information and Control, 8(6):607-639, 1965.

....S 0 on the left hand side. We denote the set of nonterminals with N , the set of terminals with T , and the set of productions with R. For simplicity, we assume that grammars do not contain epsilon productions. Before giving a formal explanation of SLR parsing, we will give an intuitive idea [14] behind this parsing method. Suppose that we are constructing a derivation in reverse, that is, from the string generated by the derivation to the start symbol. Assume also that the current string has the form B 1 : B i B i 1 ff , where the suffix B i 1 ff represents the part of the string ....

Donald E. Knuth. On the translation of languages from left to right. Information and Control, 8:607--639, 1965.

....rely on deterministic finite state machines to keep 1 The representation of parsers in the style of logical inference rules was introduced in [14] track of stack contents. All BRC grammars are also LR grammars and all LR grammars have BRC equivalents that recognize the same language (see [10, 7]) The essential difference between BRC grammars and LR grammars that are not already BRC can be illustrated by the following LR(0) grammar: S aA j bB A (A) j x B (B) j x A reduced reduce conflict would exist between A x and B x unless one keeps track of whether an a or a b was ....

.... l (ff) last l (oe) implies A fi = A 2 fi 2 and ff 2 fi 2 = oefi: If we restrict the preconditions of the definition so that ff = oe (which would also make redundant the lookback condition last l (ff) last l (oe) then this definition would be equivalent to that of LR(k) grammars ([10]) Thus it is easy to see why every BRC(l; k) grammar is immediately an LR(k) grammar. Furthermore, BRC grammars are capable of generating the same set of languages as LR grammars, namely all deterministic context free languages ( 10, 7] In particular, every LR(k) grammar has an equivalent ....

[Article contains additional citation context not shown here]

D. E. Knuth. On the translation of languages from left to right. Information and Control, 8(6):607--639, 1965.

....Adjuncts are restricted to heads at the X level, and to maximal projections at the X level. The parse in (2) contains an example of head adjunction. The verbal head has adjoined to in ection forming katta (buy past) Phrase structure recovery in pappi is implemented by a backtracking LR(1) parser (Knuth, 1965), which builds candidate phrase structures in a bottom up, left to right fashion. 2.2 Movement Phrase structure recovery may introduce underspeci ed empty categories. These empty categories may be instantiated as traces during the computation of movement. pappi directly implements overt NP ....

Knuth D. E. (1965). On the translation of languages from left to right. Information and Control, 8(6), 607-639.

....subclass of LR(k) which strictly includes k transformable and PLR(k) classes. 1 Introduction The LR(k) grammar suggested by Knuth is the largest class of grammars which can be deterministically parsed in bottom up manner on reading the input strings from left to right and looking k symbols ahead [2]. The LL(k) grammar is the counterpart of top down parsing, but known as a subclass of LR(k) grammars. In this paper, we concentrate on the problem of transforming LR(k) grammars into LL(k) forms that leftto right cover the original grammars. We call such transformed grammar LL(k) covering ....

Knuth, D.E.: On the Translation of Languages from Left to Right, Information Control 8, 607-639 (1965)

....compilation of communicating processes[4] string pattern matching[3,19] approximate string pattern matching[32] model checking[10] lexical scanning[2] and VLSI layout design[31] unit time incremental acceptance testing in a DFA CHAPTER 1. INTRODUCTION 2 is also a crucial step in LR k parsing[17]; algorithms for acceptance testing and DFA construction from regular expressions are implemented in the UNIX operating system[26] Throughout this thesis our model of computation is a uniform cost sequential RAM [1] We report the following six results. 1. Berry and Sethi[5] use results of ....

Knuth, D., "On the translation of languages from left to right", Information and Control, Vol. 8, No. 6, 1965, pp. 607 - 639.

....in practice, as it simplifies translator development. As this paper is motivated by practice not theory, we justify our arguments via examples; theoretical issues are of secondary concern. We focus on parser generator tools which automatically implement an LL(k) parser [12] 10] or an LR(k) parser [9] [8] given a grammar 1 specification, because all else being equal, we believe programmers would rather use a parser generator rather than implementing a translator by hand. In addition, programmers should be able to write natural grammars, that reflect the underlying structure of the language ....

....because computers are more powerful and because space efficient heuristics [11] have been developed that circumvent the intractable nature of parsing with k 1. ffl Second, many have felt that k 1 is unnecessary when using an LR(1) based tool because LR(1) equals LR(k 1) in recognition power [9]. However, this viewpoint is theoretical only and is erroneous in practice. i) In translation LR(1) is strictly weaker than LR(k 1) The presence of semantic actions, which must be executed immediately when encountered, makes it impossible to convert an arbitrary LR(k) grammar to an LR(k ....

Donald Knuth. On the Translation of Languages from Left to Right. Information and Control, 8:607--639, 1965.

....max(vp) max(ap) max(pp) max(xp) proj(n,n1) proj(v,v1) proj(a,a1) proj(p,p1) proj(n1,np) proj(v1,vp) proj(a1,ap) proj(p1,pp) head(n1,n) head(v1,v) head(a1,a) head(p1,p) head(np,n) head(vp,v) head(ap,a) head(pp,p) A LR(1) based parser was adopted for analysis. LR(1) parsing, (Knuth, 1965) is a well known and highly efficient method of shift reduce (bottom up) parsing that processes morphemes in a left to right manner using a single symbol of lookahead for local disambiguation. 8 The adopted algorithm relaxes the strict LR(1) requirement of zero conflicts by allowing shift reduce ....

Knuth D. E. (1965). On the translation of languages from left to right. Information and Control, 8(6), 607--639.

No context found.

D.E. Knuth. On the translation of languages from left to right. Information and Control,8:607--639, 1965. 12

No context found.

D. E. Knuth. On the translation of languages from left to right. Information and Control, 8:607-639, 1965.

No context found.

D. E. Knuth, `On the translation of languages from left to right', Information and Control 8:6 (1965), 607--639.

No context found.

D. E. Knuth, `On the translation of languages from left to right', Information and Control 8:6 (1965), 607-639.

No context found.

D. E. Knuth. On the translation of languages from left to right. Information and Control, 8:607--639, 1965.

No context found.

Knuth, D.E., On the translation of languages from left to right, Information and Control, 8(6):607-639.

No context found.

D.E. Knuth. On the translation of languages from left to right. Inform. and Control, 8:607--639, 1965.

No context found.

Knuth,D.E.: On the translation of languages from left to right,Information and Control 8:6,pp.607-639

No context found.

Donald Knuth, `On the translation of languages from left to right', Information and Control, 8, 607--639 (1965).

No context found.

Knuth, D.E. 1965 On the Translation of Languages from Left to Right. Information and Control, 8: 607- 639.

No context found.

D. E. Knuth. On the Translation of Languages from Left to Right. Information and Control, 8:607#639, 1965.

No context found.

Donald E. Knuth (1965). On the translation of languages from left to right. Information and Control 8:6, 607-639.

No context found.

K nuth, I). E., On the Translation of Languages from Left to Right, in Information and Control, vol. 8, 1965.

No context found.

Donald E. Knuth. On the translation of languages from left to right. Information and Control, 8(6):607--639, dec 1965.

First 50 documents  Next 50

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