Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ronald L. Lancaster

dblp:13/4133 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization › parsing
LR parsing
0.011976
Transforming LR(k) Grammars to LR(1), SLR(1), and (1, 1) Bounded Right-Context Grammars · J. ACM 1976
Compilers and program optimization
parsing
0.011976
Transforming LR(k) Grammars to LR(1), SLR(1), and (1, 1) Bounded Right-Context Grammars · J. ACM 1976
Automata and formal languages › formal grammars
context-free grammar
0.011976
Transforming LR(k) Grammars to LR(1), SLR(1), and (1, 1) Bounded Right-Context Grammars · J. ACM 1976
Automata and formal languages › formal grammars › context-free grammar
LR(k) grammar
0.011976
Transforming LR(k) Grammars to LR(1), SLR(1), and (1, 1) Bounded Right-Context Grammars · J. ACM 1976
YearPublicationVenuePosition
1990 The millionth computer program
abstract
The concept of a program which lists or enumerates all possible computer programs in a given language occurs frequently in the study of theoretical computer science topics such as computability and formal languages.This paper studies characteristics of such enumerations and presents a way to give students a better intuitive "feel" for this concept.A simple technique for enumerating programs is developed and is used to present the millionth computer program in an enumeration.
Larry A. Dunning, Ronald L. Lancaster
SIGCSE2
1984 Use of a syntax checker to improve student access to computing
abstract
This paper describes the design of a syntax checker which is being used to provide enhanced access to computing for introductory programming students. Syntax errors are detected on a microcomputer prior to submission of the job to the mainframe for execution. Advantages of this approach for the students, the instructor, and for the computer center are discussed.
Christopher Fox, Ronald L. Lancaster
SIGCSE2
1976 Transforming LR(k) Grammars to LR(1), SLR(1), and (1, 1) Bounded Right-Context Grammars
abstract
A method is presented for directly transforming an arbitrary LR( k ) grammar to an equivalent LR(1) grammar. It is further shown that the method transforms an arbitrary prefix-free LR( k ) grammar to an equivalent LR(0) grammar. It is argued that the method is efficient and offers some advantages over traditional “look-ahead” parsing methods. Finally, it is demonstrated that the method can be used to transform an LR(1) grammar to an equivalent SLR(1) grammar, which in turn can be easily transformed to an equivalent (1, 1) bounded right-context grammar.
M. Dennis Mickunas, Ronald L. Lancaster, Victor B. Schneider
J. ACM2
1976 Quick Compiler Construction Using Uniform Code Generators
abstract
Abstract This paper describes our experience in using a common set of code generating subroutines as the basis for compilers of ALGOL W, ALGOL 60 and subsets of PL/I and COBOL. The advantages of using a common set of primitives for implementing more than one compiler include: (1) greatly reduced effort to implement additional languages; (2) simplified maintenance of the generated compilers; (3) standardized diagnostic messages for all compilers implemented using this system; and (4) simplified documentation of the compilers.
Ronald L. Lancaster, Victor B. Schneider
Softw. Pract. Exp.1
1975 A Computer Science Practicum
abstract
An approach is described for introducing practical work experience into an undergraduate computer science curriculum. This approach differs from others which have been reported in that it is not necessary for the student to make any arrangements for academic credit in advance. The requirements for obtaining practicum credit are described, and examples of projects which have received such credit are given. This approach has made a significant contribution to the educational program by offering academic credit for learning experiences which are difficult to duplicate in a typical computer science curriculum.
Ronald L. Lancaster, Richard T. Thomas
SIGCSE1