Results 11 to 20 of about 433 (250)
Parsing Based on Programmed Grammars [PDF]
, 2012 This thesis is researching methods of parsing based on programmed grammars. It modifies known algorithm of table driven non-recursive predictive parser for context-free grammars and applies it on programmed grammars.
Pačes, Jan
core +4 more sources
Accepting grammars and systems [PDF]
, 2007 We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited ...
Bordihn, Henning, Fernau, Henning
core +2 more sources
Context-free grammars with graph-controlled tables [PDF]
, 1976 Variations of programmed grammars, where control is imposed over sets of productions rather than over single productions, are studied. This corresponds to the notion of tables in the theory of L systems. The two variations of graph controduced correspond
A. Salomaa +3 more
core +1 more source
Circular Reference Attributed Grammars - their Evaluation and Applications [PDF]
, 2003 This paper presents a combination of Reference Attributed Grammars (RAGs) and Circular Attribute Grammars (CAGs). While RAGs allow the direct and easy specification of non-locally dependent information, CAGs allow iterative fixed-point computations to be
Hedin, Görel, +2 more
core +3 more sources
Circular Reference Attributed Grammars - their Evaluation and Applications [PDF]
, 2007 This paper presents a combination of Reference Attributed Grammars (RAGs) and Circular Attribute Grammars (CAGs). While RAGs allow the direct and easy specification of non-locally dependent information, CAGs allow iterative fixed-point computations to be
Magnusson, Eva, Hedin, Görel
core +3 more sources
, 1980 In this paper, two generalizations of OL-systems called strong programmed OL-systems and weak programmed OL-systems are introduced. The interesting feature is that the class of programmed OLs contains the class of CFPGs.
Rajasethupathya, K. S. +1 more
core +1 more source
Parsing of Regulated Grammars [PDF]
, 2011 This thesis studies regulated grammars, their fundamentals and expressing power regarding Chomsky hierarchy of languages. Programmed grammars are investigated in more depth considering a few types of leftmost derivations.
Šrajer, Roman
core +2 more sources
On restricted context-free grammars [PDF]
, 2012 Context-free grammars are widely used for the simple form of their rules. A derivation step consists of the choice of a nonterminal of the sentential form and of an application of a rule rewriting it.
Jürgen Dassow +3 more
core +1 more source
On the effect of the finite index restriction on several families of grammars [PDF]
, 1978 In this paper we compare the effect of the finite index restriction on the generating power of the following classes of language-generating devices: ET0L systems, E0L systems, context-free grammars, context-free programmed grammars, ordered grammars ...
Vermeir, D., Rozenberg, G.
core +1 more source
A variant of random context grammars: Semi-conditional grammars [PDF]
, 1985 A semi-conditional grammar is a context-free grammar whose rules have two associated strings, w1, w2, and such a rule can be applied to a sentential form w only when w1 is a substring of w but w2 is not a substring of w.
Pǎun, Gheorghe
core +1 more source