Search
Now showing items 1-9 of 9
A Locally Least-Cost LL(1) Error Corrector
(University of Wisconsin-Madison Department of Computer Sciences, 1979)
A Least-Cost Error Corrector for LR(1)-Based Parsers
(University of Wisconsin-Madison Department of Computer Sciences, 1978)
An error corrector working with LR(1) parsers and variations such as SLR(1) and LALR(1) is studied. The corrector is able to correct and parse any input string. Upon detection of a syntax error, it operates by deleting ...
An Insertion Only Error Corrector for LR(1), LALR(1), SLR(1) Parsers
(University of Wisconsin-Madison Department of Computer Sciences, 1978)
An error-corrector working with LR(1) parsers and variations such as SLR(1) and LALR(1) is studied. The corrector is able to correct and parse any input string. It chooses least-cost insertions (as defined by the user) ...
On Parsing and Compiling Arithmetic Expressions in Parallel Computational Environments
(University of Wisconsin-Madison Department of Computer Sciences, 1975)
The problem of parsing and compiling arithmetic expressions in parallel computational environments is considered. It is seen that the concept of Operator Precedence can be generalized to allow encodings of one or more ...
On the Role of Error Productions in Syntactic Error Correction
(University of Wisconsin-Madison Department of Computer Sciences, 1979)
Name Protection in Block Structured Programming Languages
(University of Wisconsin-Madison Department of Computer Sciences, 1976)
Wulf and Shaw [1] have mentioned four deficiencies of Algol-like name scope rules (side effects, indiscriminant access, vulnerability, and no overlapping definition). In this paper a method is proposed to remedy these ...
A Locally Least-Cost LR-Error Corrector
(University of Wisconsin-Madison Department of Computer Sciences, 1979)
Immediate Error Detection in Strong LL(1) Parsers
(University of Wisconsin-Madison Department of Computer Sciences, 1978)
An algorithm is presented which guarantees that no erroneous actions are performed by a Strong LL(1) parser while parsing an incorrect input. The class of Strong LL(1) grammars for which this algorithm is usable appears ...
On Testing for Insert-Correctability in Context-Free Grammars
(University of Wisconsin-Madison Department of Computer Sciences, 1979)