An incremental LL(1) parsing algorithm

Wuu Yang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)67-72
Number of pages6
JournalInformation Processing Letters
Volume48
Issue number2
DOIs
StatePublished - 8 Nov 1993

Keywords

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

Fingerprint Dive into the research topics of 'An incremental LL(1) parsing algorithm'. Together they form a unique fingerprint.

Cite this