A.V. Aho and J.D. Ullman. The Theory of Parsing, Translation, and Compiling, volume I: Parsing. Prentice Hall, 1972.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Rake leaf v: Let u be v s father, w be v s brother if v has a grandparent x then Add edge u w to the tree 1. 3 Formal Languages The theory of formal languages is discussed in many classical textbooks [Sal73, Har78, HU79, Sal85] The theory of recognizing and parsing is described in [AU72, AU73, SSS88, SSS90] and in the dragon books [AU77, ASU86] The most extensive treatment of attribute grammars can be found in [DJL88] For a wealth of references on parallel recognizing and parsing the reader is referred to [AANL89, Vre91a] In the first part of this thesis we will investigate the parsing of ....

A.V. Aho and J.D. Ullman. The Theory of Parsing, Translation, and Compiling, volume I: Parsing. Prentice Hall, 1972.

.... 6 6 z x [ y x Int 4 The Algorithms We can now present the translation of computational problems for type equations into automata analogues. We shall make several references to standard algorithms for nite state automata, all of which are described in e.g. [1]. 4.1 Equivalence is Equality This rst result is quite well known for type systems [2,3] and for in nite trees in general [6] However, type equations are usually related to graphs rather than to automata. Corollary 4.1: Type equivalence translates to language equality, i.e. T 1 ; E 1 ) T ....

....i.e. T 1 ; E 1 ) T 2 ; E 2 ) i TL(auto(T 1 ; E 1 ) TL(auto(T 2 ; E 2 ) Proof: Follows from theorem 3.5 and anti symmetry of . 2 The best known algorithm for language equality runs in time O(n (n) for two n state automata. 3 3 Here (n) is the inverse of Ackermann s function [1]. 8 4.2 Ordering is Inclusion We note that this next result does not hold for type orderings that rely on coercions of values [3,7] In these situations the inclusions of component names go in opposite directions for type sums and products, which disables this automata technique. Hence, partial ....

[Article contains additional citation context not shown here]

Aho, A.V. & Ullman, J.D. \The Theory of Parsing, Translation, and Compiling. Volume 1: Parsing.", Prentice-Hall 1972.

....Problems to be studied are treated as goals: information to be found or services to be constructed. Information is context, available data, or available services. The wrapping may mention these either as requirements or as products. We use a variant of the Cocke Kasami Younger parsing algorithm [3], as modified by V. Pratt for LINGOL [69] and extended by C. Landauer for METER [38] 55] to use Early algorithm type pre filtering of the WKB entries as rules (see [27] for a description and complexity analysis of a similar combination parser, 35] for a general description of this style of ....

Alfred V. Aho, Jeffrey D. Ullman, The Theory of Parsing, Translation, and Compiling, Volume I: Parsing, Prentice-Hall (1973)

....above, then A A 0 (A is minimal) On the other hand, if we define that (a; b) 2 A i if and only if (a; b) 2 A, when i = 1, and (a; c) 2 A i Gamma1 ; c; b) 2 A, for some c 2 D, when i 1, then it can be shown that (a; b) 2 A if and only if (a; b) 2 A i , for some i 1 (c.f. [2], pp. 8 9) 4 . The reachability problem (c.f Section 2.1) is clearly an instance of the transitive closure problem. The template for the transitive closure problem can be seen in Fig. 5. Problem: Given a relation A D Theta D, find its transitive closure. Reference: 2] pp. 8 9. Input: A ....

...., for some i 1 (c.f. 2] pp. 8 9) 4 . The reachability problem (c.f Section 2.1) is clearly an instance of the transitive closure problem. The template for the transitive closure problem can be seen in Fig. 5. Problem: Given a relation A D Theta D, find its transitive closure. Reference: [2], pp. 8 9. Input: A relation A D Theta D. Output: A as defined above. Instance: C = A F(x; C) let x = a; b) for all y = b; c) 2 C insert (a; c) into C. Theorem: CT (F ; C) A . Figure 5: Transitive Closure as an instance of CT Let us now prove the involved theorem. Once ....

[Article contains additional citation context not shown here]

A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation, and Compiling. Volume I: Parsing. Prentice--Hall, 1972.

..... 22 4.3 Conflict resolution by LookAround method . 24 5 Multi pass parsing 27 6 Further work and final comments 29 1 Introduction Conventional methods for parsing programming languages originated in the early research on context free grammars [2, 8, 12, 14]. They were developed as operator precedence methods [9] bounded context methods [10] LL parsing methods [15] LR parsing methods [6] A complete history of the work in this area is found in [1, 17] The conventional notion of a programming language evolved as the set of valid strings derivable ....

....the language. Parsers developed on this basis presume the input to be a monolithic construct, generated from the single axiom. The input of stand alone phrases is, therefore, not supported and the development of incremental programming tools for phrase level activity is inhibited. CYK algorithm ([2] pages 314 320) performs a dynamic layering of the grammar non terminals at parse time and thus allows the recognition of phrases embedded within the other phrases [18] But it requires the specification rules to be in Chomsky normal form and its complexity is O(n 3 ) In contrast, the parser ....

[Article contains additional citation context not shown here]

A.V. Aho and J.D. Ullman. The Theory of Parsing, Translation, and Compiling, Volume I: Parsing. Prentice--Hall, Englewood Cliffs, N. J., 1972.

.... connections is based on the close correspondence between propositional Horn formulas and context free grammars (cf. Dowling and Gallier, 1984] In context free grammars a non terminal symbol is said to be useless if it does not occur in a sentenial form or cannot generate a terminal string (cf. [Aho and Ullman, 1972]) Correspondingly, we will call the head of a clause (viz. each connection of the head) useless if it does not occur in an SLD resolvent of the initial clause or if the conditions of the clause cannot be solved. The important property of useless non terminal symbols and connections is that they ....

....initial clause or if the conditions of the clause cannot be solved. The important property of useless non terminal symbols and connections is that they can be determined statically by analyzing the set of productions and clauses, respectively. Algorithms for context free grammars can be found in [Aho and Ullman, 1972]. Informally, these algorithms are encoded in the following rules, where we assume that the initial formula does not contain any useless connections. ffl If the head of a clause is not engaged in any connection (i.e. if all connected units for connections with the head are deactivated) then ....

A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation, and Compiling, volume I: Parsing. Prentice-Hall, Englewood Cliffs, N. J., 1972.

....novel alignment algorithms will be presented in this paper based on such finite state automata. Current address: Department of Computer Science, University of California at Davis, murphyk cs.ucdavis.edu 1 2 Models The basic theoretical construct with which we will deal is the following [1]: Definition 2.1 (Finite Transducer) A finite transducer is a 6 tuple T = hQ; Sigma; Omega ; ffi; s; F i where Q is a finite nonempty set of states, Sigma and Omega are finite nonempty input and ouput alphabets, respectively, s 2 Q is a distinguished start state, F Q is a set of final ....

A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation, and Compiling. Volume 1: Parsing. Printice-Hall, Englewood Cliffs, NJ, 1972.

....finite automaton which emits an output string during each move made. It defines a translation, i.e. a set of pairs of strings. In each pair (ff; fi) ff is a word over the input alphabet and fi is a word over the output alphabet. A classical work considering the use of translations on compilers is [1]. This note deals with the inductive inference properties of finite transducers and the translations realized by them. Given a set of pairs of input and output strings, we consider the problem of inferring a transducer consistent with the pairs. Transducers are earlier studied in the context of ....

A.V. Aho, and J.D. Ullman, The Theory of Parsing, Translation, and Compiling. Volume I: Parsing . Prentice-Hall, 1972.

No context found.

A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation, and Compiling, Volume I: Parsing. Prentice-Hall, Englewood Cliffs, NJ, 1972.

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