Eric de la Clergerie and Francois Barth'elemy. Information flow in tabular interpretations for generalized Push-Down Automata. Theoretical Computer Science, 199(1--2):167--198, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Interprocedural Analyses: A Comparison - Seidl, Fecht (1999) (Correct)
.... this kind of situation where a small step operational semantics has been favored [11,46] The small step operational semantics of recursion is most naturally modeled by pushdown automata (PDAs) Related concepts have successfully been used for imperative languages [49,33,2,4] as well as for Prolog [39,16,17]. In order to derive an analysis engine, this framework proceeds in three stages. In the first stage, the concrete operational semantics is simulated by an abstract operational semantics [46] Ideally, while preserving the control structure, we would only abstract data and the operations on ....
....There are several ways how such pushdown automata can be defined. Lang [39] for instance follows the tradition in parsing theory. He views intermediate configurations as sequences of stack symbols and the set of transitions as left rewrite system. For a recent presentation, see also [17]. Instead, we insist on an explicit distinction between 7 the current program state and stack symbols. In our presentation, stack symbols either represent the current program point (in which case they occur on top of the stack) or stacked activation records. Stacked activation records correspond ....
Eric Villemonte de la Clergerie and Francois Barth'elemy. Information Flow in Tabular Interpretations for Generalized Pushdown Automata. Theoretical Computer Science (TCS), 199(1&2):167--198, 1998.
A formal definition of Bottom-up Embedded Push-Down.. - Alonso, Clergerie.. (2001) Self-citation (Clergerie) (Correct)
....for a given grammar can be translated into a set of transitions defining a (possibly non deterministic) automaton and then the automaton can be executed using some standard technique. In this section we define a generic compilation schema for tree adjoining grammars based on a call return model [9]. We consider each elementary tree fl of a TAG as formed by a set of context free productions P(fl) a node N fl and its g children N fl 1 : N fl g are represented by a production N fl N fl 1 : N fl g . The elements of the productions are the nodes of the tree, except for the ....
Eric de la Clergerie and Francois Barth'elemy. Information flow in tabular interpretations for generalized Push-Down Automata. Theoretical Computer Science, 199(1--2):167--198, 1998.
Practical aspects in compiling tabular TAG parsers - Alonso, Seddah, Clergerie (2000) Self-citation (Villemonte) (Correct)
....The prediction atoms T ; B and propagation atoms T ; B are built using modulations from the node arguments T and B completed by position variables ( P ; P ) and ( P ; P ) used to delimit the span of including or not adjunction. 3 A modulation (Barthlemy Villemonte de la Clergerie, 1998) is formalized as a pair of projection morphisms ( such that, for all atoms A; B, mgu(A; B) mgu(AA;BB) For TAGs, we offer the possibility to have distinct modulations ( t ; t ) and ( b ; b ) for top and bottom arguments, as well as a third one ( n ; n ) for nodes, leading to the ....
BARTHLEMY F. & VILLEMONTE DE LA CLERGERIE E. (1998). Information flow in tabular interpretations for generalized push-down automata. Theoretical Computer Science, 199, 167--198.
A formal definition of Bottom-up Embedded Push-Down.. - Alonso, Clergerie.. (2000) Self-citation (Clergerie) (Correct)
....then the automaton can be executed using some standard technique. In this section we define a generic compilation schema for tree adjoining grammars a RET SCALL SRET b g CALL FootRET AdjCALL AdjRET FootCALL SubsRET SubsCALL Figure 4: Meaning of compilation rules based on a call return model [6]. We consider each elementary tree fl of a TAG as formed by a set of context free productions P(fl) a node N fl and its g children N fl 1 : N fl g are represented by a production N fl N fl 1 : N fl g . The elements of the productions are the nodes of the tree, except for the ....
Eric de la Clergerie and Francois Barth'elemy. Information flow in tabular interpretations for generalized Push-Down Automata. Theoretical Computer Science, 199(1--2):167--198, 1998.
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