Ajit B. Pai

dblp:66/1940 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1980
—ORCID · none

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

Software engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Theory of computation · 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 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
parsing
0.011980
Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers · ACM Trans. Program. Lang. Syst. 1980
Compilers and program optimization › parsing
syntax error recovery
0.011980
Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers · ACM Trans. Program. Lang. Syst. 1980

Methods — techniques the papers use, named apart from their topics

table-driven parsing · 0.0parser generation · 0.0
YearPublicationVenuePosition
1980 Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
abstract
Described is a method for syntactic error recovery that is compatible with deterministic parsing methods and that is able to recover from many errors more quickly than do other schemes because it performs global context recovery. The method relies on fiducial symbols, which are typically reserved key words of a language, to provide mileposts for error recovery. The method has been applied to LL(1) parsers, for which a detailed algorithm is given, and informally proved correct. The algorithm will always recover and return control to the parser if the text being analyzed satisfies only minimal requirements: that it contains one or more occurrences of fiducial symbols following the point at which an error is detected. Tables needed for error recovery have been automatically generated, along with parsing tables, by a parser constructor for the LL(1) grammars. A theoretical characterization of fiducial symbols is given, and the utility of this characterization in practice is discussed. It has been applied to a grammar for the programming language Pascal to aid in selection of a set of fiducial symbols. The error recovery scheme has been tested on a set of student-written Pascal program texts and is compared with other error recovery strategies.
Ajit B. Pai, Richard B. Kieburtz
ACM Trans. Program. Lang. Syst.1
1977 Generalizations of Line Graphs and Applications
Narsingh Deo, Mukkai S. Krishnamoorthy, Ajit B. Pai
Inf. Process. Lett.3