Incremental algorithms in PROF-LP

Gyimóthy, Tibor; Horváth, Tamás; Kocsis, Ferenc; Toczki, J.

doi:10.1007/3-540-51364-7_7

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1990

1991

Publication Types

Select...

Book2

Article1

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Lazy recursive descent parsing for modular language implementation

Koskimies

1990

Softw Pract Exp

View full text Add to dashboard Cite

A variant of the well‐known recursive descent parsing technique is developed, based on the assumption that each non‐terminal of the language is implemented through a separate module. The modularization principle requires that the recursive descent parser of one non‐terminal must be written knowing only the production rules of that non‐terminal, and not the other parts of the language. This leads to a parsing technique which is ‘lazy’ in the sense that part of the parser is constructed during parsing, according to the needs of a particular input text. It turns out that this technique can be implemented as efficiently as conventional recursive descent parsing, which is one of the fastest known parsing methods. The main benefit of the technique is that it allows a language to be implemented in small pieces which are easy to modify, replace, and reuse.

show abstract