An incremental LL(1) parsing algorithm

Wuu Yang

doi:10.1016/0020-0190(93)90179-D

An incremental LL(1) parsing algorithm

Wuu Yang^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Given a parse tree for a sentence xzy and a string z̄, an in cremental parser builds the parse tree for the sentence xz̄y by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from the grammar.

Original language	English
Pages (from-to)	67-72
Number of pages	6
Journal	Information Processing Letters
Volume	48
Issue number	2
DOIs	https://doi.org/10.1016/0020-0190(93)90179-D
State	Published - 8 Nov 1993

Keywords

Design of algorithms
Incremental parsing
Language processors
Language-based editor
Parsing

Access to Document

10.1016/0020-0190(93)90179-D

Cite this

@article{95994120a301437399f609f8d487868a,

title = "An incremental LL(1) parsing algorithm",

abstract = "Given a parse tree for a sentence xzy and a string {\=z}, an in cremental parser builds the parse tree for the sentence x{\=z}y by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from the grammar.",

keywords = "Design of algorithms, Incremental parsing, Language processors, Language-based editor, Parsing",

author = "Wuu Yang",

year = "1993",

month = nov,

day = "8",

doi = "10.1016/0020-0190(93)90179-D",

language = "English",

volume = "48",

pages = "67--72",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - An incremental LL(1) parsing algorithm

AU - Yang, Wuu

PY - 1993/11/8

Y1 - 1993/11/8

N2 - Given a parse tree for a sentence xzy and a string z̄, an in cremental parser builds the parse tree for the sentence xz̄y by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from the grammar.

AB - Given a parse tree for a sentence xzy and a string z̄, an in cremental parser builds the parse tree for the sentence xz̄y by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from the grammar.

KW - Design of algorithms

KW - Incremental parsing

KW - Language processors

KW - Language-based editor

KW - Parsing

UR - http://www.scopus.com/inward/record.url?scp=0027912497&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(93)90179-D

DO - 10.1016/0020-0190(93)90179-D

M3 - Article

AN - SCOPUS:0027912497

SN - 0020-0190

VL - 48

SP - 67

EP - 72

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

An incremental LL(1) parsing algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this