Results 1  10
of
12
An Efficient ContextFree Parsing Algorithm
, 1970
"... A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; i ..."
Abstract

Cited by 663 (0 self)
 Add to MetaCart
A parsing algorithm which seems to be the most efficient general contextfree algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar topdown algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical contextfree programming language grammars. In an empirical comparison it appears to be superior to the topdown and bottomup algorithms studied by Griffiths and Petrlck.
Automatic Error Recovery for LR Parsers
, 1978
"... In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser. The approach, which is patter ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information that is already present in an LR parser. The approach, which is patterned after that of Levy and Graham and Rhodes, appears to provide error recovery which is both simple and powerful.
Niklaus Wirth — A Pioneer of Computer Science 1
"... Niklaus Wirth is one of the most influential scientists of the early computer age. His ideas and especially his programming languages have shaped generations of programmers worldwide. This paper tries to acknowledge the scientific achievements of Niklaus Wirth and to honor him as a person. A small p ..."
Abstract
 Add to MetaCart
Niklaus Wirth is one of the most influential scientists of the early computer age. His ideas and especially his programming languages have shaped generations of programmers worldwide. This paper tries to acknowledge the scientific achievements of Niklaus Wirth and to honor him as a person. A small part of the paper is also devoted to Wirth's influence on computer science at the Johannes Kepler University of Linz.
Programming R. Morris
"... This paper presents an approach to writing specifications for parts of software systems. The main goal is to provide specifications sufficiently precise and complete that other pieces of software can be written to interact with the piece specified without additional information. The secondary g ..."
Abstract
 Add to MetaCart
This paper presents an approach to writing specifications for parts of software systems. The main goal is to provide specifications sufficiently precise and complete that other pieces of software can be written to interact with the piece specified without additional information. The secondary goal is to include in the specification no more information than necessary to meet the first goal. The technique is illustrated by means of a variety of examples from a tutorial system
Programming T.A. Standish Languages Editor SyntaxDirected Least Errors Analysis for ContextFree Languages: A Practical Approach
"... A leasterrors recognizer is developed informally using the wellknown recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a general class of contextfree grammars as drivers, and any finite string as input. Recognition consists of a leasterrors cou ..."
Abstract
 Add to MetaCart
A leasterrors recognizer is developed informally using the wellknown recognizer of Earley, along with elements of Bellman's dynamic programming. The analyzer takes a general class of contextfree grammars as drivers, and any finite string as input. Recognition consists of a leasterrors count for a corrected version of the input relative to the driver grammar. The algorithm design emphasizes practical aspects which help in programming it. Key Words and Phrases: arbitrary input strings, contextfree grammars, parsing, dynamic programming, stored subanalyses, separability, state merging, leasterrors correction CR Categories: 4.12, 5.23, 5.42
Abstract Identifiers and Textual Reference
, 2002
"... Here are three proposals concerning the structure and maintenance of formal, interreferential, digitally stored texts: (1) include abstract atomic identifiers in texts, (2) identify these identifiers with references to text objects, and (3) keep among the texts records of computationally substantia ..."
Abstract
 Add to MetaCart
Here are three proposals concerning the structure and maintenance of formal, interreferential, digitally stored texts: (1) include abstract atomic identifiers in texts, (2) identify these identifiers with references to text objects, and (3) keep among the texts records of computationally substantiated claims about those texts. We use “formal ” in a narrow sense approximating computercheckable. We are informed by informal symbolic practices used in mathematical text and program source text, which we hope to enhance and exploit explicitly; the basic management problem is how to alter texts rather freely without ruining the bases for claims depending upon them, which becomes an issue of accounting for various dependencies between texts. We are not here proposing the use of abstract structured text; nonetheless, experience using it in Nuprl4 has led us to appreciate the benefits of distinguishing abstract form from concrete presentation, and also has shown us the cognitive and practical unimportance of just which identifiers occur in abstract structured texts when texts are mediated by a system that realizes concrete presentation. Abstract treatment of identifiers involves concrete realization during communications between “text servers ” and their clients. The benefit of treating identifiers abstractly is a radical avoidance of
INFORMATION SCIENCES 159 Quantitative Fuzzy Semantics?
"... The point of departure in this paper is the definition of a language, L, as a fuzzy relation from a set of terms, T = {x}, to a universe of discourse, U = {y}. As a fuzzy relation, L is characterized by its membership function c(=: T x CJf [O,l], which associates with each ordered pair (x,y) its g ..."
Abstract
 Add to MetaCart
The point of departure in this paper is the definition of a language, L, as a fuzzy relation from a set of terms, T = {x}, to a universe of discourse, U = {y}. As a fuzzy relation, L is characterized by its membership function c(=: T x CJf [O,l], which associates with each ordered pair (x,y) its grade of membership, &,y), in L. Given a particular x in T, the membership function &x,y) defines a fuzzy set, M(x), in U whose membership function is given by p,&y) = p&y). The fuzzy set M(x) is defined to be the meaning of the term X, with x playing the role of a name for M(x). I f a term x in T is a concatenation of other terms in 7’, that is, x = x1 *. * x., x, E T, i=l,...,n, then the meaning of x can be expressed in terms of the meanings of x,,...,xn through the use of a lambdaexpression or by solving a system of equations in the membership functions of the x, which are deduced from the syntax tree of x. The use of this approach is illustrated by examples. 1.