NDLI: The design of parsers for incremental language processors

Please wait, while we are loading the content...

On the size of programs in subrecursive formalisms

The degree hierarchy of undecidable problems of formal grammars

Unsolvability considerations in computational complexity

Recursive properties of abstract complexity classes (Preliminary Version)

Hierarchies based on computational complexity and irregularities of class determining measured sets (Preliminary Report)

On bounds on the number of steps to compute functions

Data graphs and addressing schemes (Extended Abstract)

Complexity problems in real time computation

Path systems and language recognition

A result on the relationship between simple precedence languages and reducing transition languages

The design of parsers for incremental language processors

Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)

Closure of families of languages under substitution operators

Tree-oriented proofs of some theorems on context-free and indexed languages

Tree-manipulating systems and Church-Rosser Theorems

On syntax-directed transduction and tree transducers

Transformations on straight line programs - (Preliminary Version)

The correctness of a modified SECD machine

Second-order mathematical theory of computation

An interpretation oriented theorem prover over integers

The predicate elimination strategy in theorem proving

Translating recursion equations into flow charts

Probabilistic Tree Automata

The analysis of two-dimensional patterns using picture processing grammars

On the relationship between finite automata, finite monoids, and prefix codes.

On some families of languages related to the Dyck language

Three theorems on abstract families of languages

The design of parsers for incremental language processors

Content Provider	ACM Digital Library
Author	Lindstrom, G.
Abstract	An incremental language processor is one that accepts as input a sequence of substrings of the source language and maps them independently onto fragments in some object code. The ordered sequence of these object code fragments are then either compiled, in which case we have an incremental compiler, or interpreted. In the first case the advantage resulting is that subsequent changes in the source program entail only reprocessing the source fragments affected and recompiling the updated collection of object code fragments. In an environment where small changes are made frequently to large programs, e.g. debugging, the curtailment of reprocessing is attractive. In the second case the object code fragments are the actual run-time program representation, and hence inter-fragment relations are transiently evaluated as needed in the process of execution, with no long-term preservation of these relationships beyond the scope of their immediate need in execution time. This permits the possibility of program recomposition in the midst of execution, one of the principal characteristics of conversational computing. Many conversational language processors execute a program representation functionally analogous to parse trees, i.e. the syntax analysis of a fragment, insofar as it is possible, is done at fragment load time. This representation choice is popular because many of the expensive aspects of interpretation, including character string scanning, symbol table lookup, and parsing, are performed once only and do not contribute to the execution overhead. This paper is devoted to examining the question of the construction of such a parser in a general manner for an arbitrary source language.
Starting Page	81
Ending Page	91
Page Count	11
File Format	PDF
DOI	10.1145/800161.805153
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1970-05-04
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Design principles for packet parsers

Networks of Evolutionary Processors as Natural Language Parsers

Incremental generation of parsers

An incremental compilation algorithm for the Java programming language

Design principles for packet parsers

Architectural Design Patterns for Language Parsers

Comparison of Structural Parsers and Neural Language Models as Surprisal Estimators

Incremental generation of parsers

Efficient implementation of beam-search incremental parsers ∗.

The design of parsers for incremental language processors

Similar Documents

Design principles for packet parsers

Networks of Evolutionary Processors as Natural Language Parsers

Incremental generation of parsers

An incremental compilation algorithm for the Java programming language

Design principles for packet parsers

Architectural Design Patterns for Language Parsers

Comparison of Structural Parsers and Neural Language Models as Surprisal Estimators

Incremental generation of parsers

Efficient implementation of beam-search incremental parsers ∗.

The design of parsers for incremental language processors