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

....computational scheme. This can be rectified by refreshing the CR, i.e. by reinitializing the value of components periodically. If the refreshing is done over the regular number of points, we find that this is analogous to a well known program optimizing transformation, called loop unrolling [1]. In the general case we will use multidimensional loop unrolling [9] but here we start with a two dimensional one as an example. Given F (i) which has to be evaluated for i = 0; n, assuming that n 1 = m Delta q, we can compute the required values using inner unrolling F (j Delta q ....

Aho, A., and Ullman, J. The Theory of Parsing, Translation and Compiling, Vol.2. Englewood Cliffs, N.J.: Prentice-Hall, 1972.

....how the actor alters its output concepts based on its input concepts. 5 . STATE TRANSITION DIAGRAMS This section illustrates the process of obtaining an R Spec Graph from a state transition diagram. We take the definition of state transition diagrams (STD) based on input tokens as described in [24]. We will translate state transition diagrams into conceptual graphs by using instances of the concept STATE to represent each state, a demon to represent each transition, and instances of DATA to represent each input and output token. The demon s semantics are described in [25] they are somewhat ....

....directed from process a k towards process a i in R Spec. Mark c. preserve intermediate flows. end loop end Algorithm 2b. This concludes the translation scheme for data flow diagrams. State Transition Translation Scheme We use the standard definition of state transitions based on input symbols [24], although we may be able to generalize our definition to include any event as an input symbol or output symbol. In the standard definition, each event therefore means the arrival of an input symbol or the creation of an output symbol. We will translate state transition diagrams into conceptual ....

A.V. Aho, The Theory of Parsing, Translation and Compiling, Prentice-Hall, Vol. I, Englewood Cliffs, New Jersey 1972.

....not consider complexity results at all, neither of recognition by various classes of sequential or parallel Turing machines nor of succinctness (see e.g. 52] that is a measure of the size of the description of a language. We have chosen to present material which is not available in textbooks [17, 29, 1, 47, 28, 4, 30, 32, 2] (more precisely not available in more than one textbook) because it is on the borderline between classical stuff and advanced topics. However, we feel that a succinct exposition of these results may give some insight in the theory of context free languages for advanced beginners, and also provide ....

A.V. Aho and J.D. Ullman. The Theory of Parsing, Translation and Compiling., volume 1. Prentice-Hall, 1973.

....can lead to the definition of complex systems is given in the following. In [Seki et al., 1989] a tabular method has been presented for the recognition of general LCFR languages as a generalization of the well known CYK algorithm for the recognition of CFG s (see for in stance [Younger, 1967] and [Aho and Ullman, 1972]) In the following we will apply such a general method to the recognition of LCFRS(2) with the aim of hav ing an intuitive understanding of why it might be difficult to parse unrestricted crossing configurations. Let w be an input string of length n. In Figure 2, the case of a production p : A ....

A. V. Aho and J. D. Ull- man. The Theory of Parsing, Translation and Compiling, volume 1. Prentice-Hall, Englewood Cliffs, N J, 1972.

....that the parser does not maintain a chart as in chart ilarsing. Our method also prr)vides an elegant solution to the problem of multi part of.speech words such as that . The MLR parser and its parsing table generator have been implemented at Carnegie Mellon University, I Introduction LR parsers [1, 2] have been developed originally for programming language of compilers. An LR parser is a shift reduce parser which is deterministically guMed by a parsirg table indicating whal action should be taken next. The parsing table can be obtained automatically from a context free phrase structure ....

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

....of offline parsable grammars which we will call here the class of explicitly offiine parsable grammars is the class of DCGs whose context free skeleton is a proper context free grammar. that is, a grammar without rules of the type A [ empty productions) or of the type A B (chain rules) [1]. This subclass is much less problematic to parse than the full class of offline parsable DCGs (for insumce a leA comar parsing algorithm will work) However, it is an easy consequence of the GGNF result that, for any offiine parsable DCG, there exists an explicitly offiine parsable DCG equivalent ....

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

....symbol. Moreover, the number of automaton states is reduced. Our timings show that, especially for highly ambiguous grammars, the parser is significantly faster than a standard GLR parsertl 2 Definitions 2. 1 Languages, Grammars, Recursion We use standard notation as defined in texts such as [2], 10] or [21] Let an alphabet be a finite set of symbols. A lansuase over an alphabet T is a set of strings over T. The notation T denotes the set of all strings over T including the empty string, denoted by c. Set T is defined as T = T c . Similarly for string a 6 T , the notation a ....

....table, which the parser is driven by. The initial configuration is the triple (#, w t, c) where # is the initial stack symbol and cvp(#) c. The final, accepting configuration is (# [ Z t , r) where (#, w t, # [ Z t, 7r) cvp(# [ Z t ) S t, and r is a right parse of w. [2], 20] 25] and [26] provide further information on GLR parsing. 3 Reductions between Shifts of Two Adjacent Symbols Grammars without right and hidden left recursions have a property which proves to be useful in the context of GLR parsing. Namely, after shifting an input symbol, the number of ....

Aho, A.V., Ullman, J.D. The Theory of Parsing, Translation and Compiling. Vol. 1: Parsing, Vol. 2: Compiling, Prentice-Hall, New York, 1972.

....the use of language generators, called grammars. The translation of a language into one understandable by a machine is carried out by compilers, which are also built using grammars and associated rules of translation. A prevalent method is the so called semantic attribute method due to Irons [1], 26] 27] An automation of this process for particular grammars has been done with the very wellknown programs LEX and YACC which are available free by FTP on an INTERNET site. These programs are heavily used by people interested in compilers or friendly interfaces. In addition to having ....

....implemented in the software package CalICo [16] 12] which we are developing in Bordeaux. 2 Definitions and notation This section summarizes briefly the notions needed for understanding this paper. A more complete background can be acquired from Berstel [3] Ginsburg [23] Aho and Ullmann [1]. Let X be a nonempty set called alphabet. The elements of X are called letters. A word is a finite sequence of letters from X. The empty word is usually denoted by e. Let u and v be two words on X, u=u 1 . u p and v=v 1 . v q . We define the concatenation of two words to be uv=u 1 . u p v 1 ....

A. Aho, J. Ullman, The theory of parsing, translation and compiling, Prentice Hall, Englewood Cliffs, NJ, 1973.

....has many good properties of context free grammars, for example being closed under union, concatenation, homomorphisms, being semilinear, etc. Also, there exist polynomial parsing algorithms for this class [9, 6] There exist several well known pumping lemmas for context free languages (see e.g. [1]) which state some necessary conditions for a language to be contextfree. One of these lemmas has been proven by W. Ogden [7] In the current paper we prove that coupled context free languages must satisfy some conditions that are similar to those in Ogden s lemma, actually Ogden s result is a ....

A. V. Aho, J. D. Ullman. The Theory of Parsing, Translation and Compiling. Vol. 1: Parsing. Prentice-Hall, Inc. Englewood Clis, N. J. 1972.

....where a less general but faster algorithm would be more appealing. In addition, the requirement for a grammar to be in the binary normal form is also a very inconvenient constrain. There exist numerous linear time parsing algorithms for various subclasses of the context free grammars; the LL(k) [1, 4] and LR(k) 1, 2] algorithms and some of their variations are the most widely used among them. It turns out that the SLL(k) strong LL(k) context free parsing method can be effectively extended for the case of conjunctive grammars. The construction and explanation of the resulting algorithm is ....

....but faster algorithm would be more appealing. In addition, the requirement for a grammar to be in the binary normal form is also a very inconvenient constrain. There exist numerous linear time parsing algorithms for various subclasses of the context free grammars; the LL(k) 1, 4] and LR(k) [1, 2] algorithms and some of their variations are the most widely used among them. It turns out that the SLL(k) strong LL(k) context free parsing method can be effectively extended for the case of conjunctive grammars. The construction and explanation of the resulting algorithm is the main concern of ....

[Article contains additional citation context not shown here]

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

....symbol (only in the qualisign class) or a relational need r = t; y) where t C and y is a nite set (of syntactic properties) The logical type of r is de ned by the function as follows: t; y) A if t = and B, otherwise. Nondeterminism is assumed to be implemented by backtracking ([1]) In the de nition of we will allow a reference to the current value of the evaluation mode, forward( f ) or backward( b ) via the function mode . Finally, we will make use of a graph G = C; E) where E= E d [ E h , and E d ; E h C C are, respectively, the set of directed edges and ....

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

....relations producing single symbols is output delimited. 4 Testing SXMDG (Weak) output distinguishability and (strong) memory completeness as well as their more relaxed counterparts are addressed in this section. Output distinguishability will take place for SXMDG having a LL(1) like property [1]. For a string x; first 1 (x) denotes the set fa j a 2 A; 9r 1; x = r ayg; r 2 DM: Lemma 1. Any SXMDG X d ; d 2 DM 0 with the property that for any two rules S x 1 2 P i ; S x 2 2 P j ; i 6= j it follows first 1 (x 1 ) first 1 (x 2 ) then X d is output distinguishable. Proof. If ....

A. Aho, J. Ullman, The Theory of Parsing, Translation and Compiling, Vol. I: Parsing, Prentice-Hall, Englewood Clis, N.J, 1972.

No context found.

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

No context found.

Alfred V. Aho and Je#rey D. Ullman. The Theory of Parsing, Translation and Compiling, volume II.: Compiling. Prentice-Hall, Englewood Cli#s, N.J., 1973.

No context found.

Alfred V. Aho and Je#rey D. Ullman. The Theory of Parsing, Translation and Compiling, volume I.: Parsing. Prentice-Hall, Englewood Cli#s, N.J., 1972.

No context found.

A. V. Aho, J. D. Ullman: The Theory of Parsing, Translation and Compiling. Vol. 1: Parsing. Prentice Hall (1972).

No context found.

Alfred. V. Aho and Je#rey D. Ullman. The Theory of Parsing, Translation and Compiling, volume 1. Prentice-Hall, Englewood Cli#s, NJ, 1972.

No context found.

Aho, A. V. and Ullman, J. D., The Theory of Parsing, Translation and Compiling, Prentice Hall, Englewood Cliffs, New Jersey, 1973.

No context found.

Alfred V. Aho and Jeffrey D. Ullman. The Theory of Parsing, Translation and Compiling. Prentice-Hall, Englewood Cliffs, NJ, 1973. I and II.

No context found.

A. Aho and J.Ullman. The Theory of Parsing,Translation and Compiling. Prentice-Hall, 1972.

No context found.

A.V. Aho and J.D. Ullman. The Theory of Parsing, Translation and Compiling, volume 1-2. Prentice-Hall, Englewood Cli, New Jersey, U.S.A., 1973.

No context found.

Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation and Compiling, Vol.

No context found.

Alfred V. Aho, and Jeffrey D. Ullman, The Theory of Parsing, Translation and Compiling, Vol. 1, Prentice-Hall, Englewood Cliffs, NJ, 1972.

No context found.

A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation and Compiling, Volume 1, PrenticeHall, Englewood Cliffs, New Jersey, 1972.

No context found.

Alfred V. Aho and Jerey D. Ullman. The Theory of Parsing, Translation and Compiling. Prentice Hall, 1972.

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