Results 1  10
of
502,423
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 559 (0 self)
 Add to MetaCart
"Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications
Normal Form Algorithms for Extended ContextFree Grammars
 Theoretical Computer Science
, 2000
"... We investigate the complexity of a variety of normalform transformations for extended contextfree grammars, where by extended we mean that the set of righthand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will p ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
We investigate the complexity of a variety of normalform transformations for extended contextfree grammars, where by extended we mean that the set of righthand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which
Generalized ContextFree Grammars
, 1996
"... We consider several language generating formalisms from the literature, such as stringvalued attribute grammars with only sattributes, parallel multiple contextfree grammars, relational grammars and topdown treetostring transducers, of which we have chosen the OnlyS stringvalued attribute gra ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider several language generating formalisms from the literature, such as stringvalued attribute grammars with only sattributes, parallel multiple contextfree grammars, relational grammars and topdown treetostring transducers, of which we have chosen the OnlyS stringvalued attribute
Generation and Synchronous TreeAdjoining Grammars
, 1990
"... Treeadjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations. We dem ..."
Abstract

Cited by 772 (43 self)
 Add to MetaCart
Treeadjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations. We
Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora
, 1997
"... ..."
Multiple ContextFree Grammars
"... Multiple contextfree grammar (MCFG) is a weakly contextsensitive grammar formalism that deals with tuples of strings. An MCFG is called mMCFG if all tuples have at most m components. In this summary I will outline that the expressivity of mMCFG’s increases with the parameter m and that the class ..."
Abstract
 Add to MetaCart
Multiple contextfree grammar (MCFG) is a weakly contextsensitive grammar formalism that deals with tuples of strings. An MCFG is called mMCFG if all tuples have at most m components. In this summary I will outline that the expressivity of mMCFG’s increases with the parameter m
Ordered ContextFree Grammars
"... Contextfree grammars (CFGs) provide an intuitive and powerful formalism for describing the syntactic structure of parsable input streams. Unfortunately, existing online parsing algorithms for such streams admit only a subset of possible CFG descriptions. Theoretically, it is possible to parse any ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Contextfree grammars (CFGs) provide an intuitive and powerful formalism for describing the syntactic structure of parsable input streams. Unfortunately, existing online parsing algorithms for such streams admit only a subset of possible CFG descriptions. Theoretically, it is possible to parse any
Extended ContextFree Grammars and Normal Form Algorithms
, 1998
"... We investigate the complexity of a variety of normalform transformations for extended contextfree grammars, where by extended we mean that the set of righthand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will prov ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We investigate the complexity of a variety of normalform transformations for extended contextfree grammars, where by extended we mean that the set of righthand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which
ContextFree Grammars and Languages
"... � � V is a finite set of variables (nonterminals) � ∑, the alphabet, is a finite set of terminal symbols � P is a finite set of rules of the form V × (V ∪ ∑)*, and � S ∈ V, is the start symbol � � A production rule of the form A → ww, where w ∈ (V ∪ ∑)*, applied to the string uAv yields uwv, and u ..."
Abstract
 Add to MetaCart
and v define the context in which A occurs. � Because the context places no limitations on the applicability of a rule, such a grammar is called contextfree grammar (CFG) 2
Results 1  10
of
502,423