Results 1  10
of
29,271
THE ALGORITHM FOR REDUCING THE NUMBER OF THE NONTERMINAL SYMBOLS IN THE FE0L SYSTEMS ABSTRACT
"... This paper introduces FE0L (forbidding contextfree L systems) and FET0L (FE0L systems with tables) systems with permitting conditions and the algorithm for reducing the number of the nonterminal symbols in FE0L (FET0L) systems. The productions of FE0L (FET0L) systems (grammars) do not have only the ..."
Abstract
 Add to MetaCart
This paper introduces FE0L (forbidding contextfree L systems) and FET0L (FE0L systems with tables) systems with permitting conditions and the algorithm for reducing the number of the nonterminal symbols in FE0L (FET0L) systems. The productions of FE0L (FET0L) systems (grammars) do not have only
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
of this process when some of the attributes are "synthesized", i.e., defined solely in terms of attributes of the descendants of the corresponding nonterminal symbol, while other attributes are "inherited", i.e., defined in terms of attributes of the ancestors of the nonterminal symbol
Learning Accurate, Compact, and Interpretable Tree Annotation
 In ACL ’06
, 2006
"... We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals. In co ..."
Abstract

Cited by 413 (42 self)
 Add to MetaCart
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals
Refining the nonterminal complexity of graphcontrolled grammars
 In Proceedings of the DCFS
, 2005
"... We refine the classical notion of the nonterminal complexity of graphcontrolled grammars, programmed grammars, and matrix grammars by also counting, in addition, the number of nonterminal symbols that are actually used in the appearance checking mode. We prove that every recursively enumerable lang ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We refine the classical notion of the nonterminal complexity of graphcontrolled grammars, programmed grammars, and matrix grammars by also counting, in addition, the number of nonterminal symbols that are actually used in the appearance checking mode. We prove that every recursively enumerable
DART: Directed automated random testing
 In Programming Language Design and Implementation (PLDI
, 2005
"... We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static sourcecode parsing; (2) automatic generation of a test driver for this interface that performs ..."
Abstract

Cited by 823 (41 self)
 Add to MetaCart
such as program crashes, assertion violations, and nontermination. Preliminary experiments to unit test several examples of C programs are very encouraging.
Stochastic Inversion Transduction Grammars and Bilingual Parsing of Parallel Corpora
, 1997
"... ..."
Interprocedural Slicing Using Dependence Graphs
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1990
"... ... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previou ..."
Abstract

Cited by 822 (85 self)
 Add to MetaCart
... This paper concerns the problem of interprocedural slicinggenerating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previous dependence representations to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. Our main result is an algorithm for interprocedural slicing that uses the new representation. (It should be noted that our work concerns a somewhat restricted kind of slice: Rather than permitting a program to be sliced with respect to program point p and an arbitrary variable, a slice must be taken with respect to a variable that is defined or used at p.) The chief
Three Generative, Lexicalised Models for Statistical Parsing
, 1997
"... In this paper we first propose a new statistical parsing model, which is a generative model of lexicalised contextfree gram mar. We then extend the model to in clude a probabilistic treatment of both subcategorisation and wh~movement. Results on Wall Street Journal text show that the parse ..."
Abstract

Cited by 567 (8 self)
 Add to MetaCart
In this paper we first propose a new statistical parsing model, which is a generative model of lexicalised contextfree gram mar. We then extend the model to in clude a probabilistic treatment of both subcategorisation and wh~movement. Results on Wall Street Journal text show that the parser performs at 88.1/87.5% constituent precision/recall, an average improvement of 2.3% over (Collins 96).
Accepting Programmed Grammars without Nonterminals
, 1995
"... this paper, we consider the pure versions of this grammar type where we give up the distinction between terminal and nonterminal symbols. Such pure grammars are of interest because of the following reasons: ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
this paper, we consider the pure versions of this grammar type where we give up the distinction between terminal and nonterminal symbols. Such pure grammars are of interest because of the following reasons:
Results 1  10
of
29,271