Incremental LR parsers
| ISSN: |
1432-0525
|
|---|---|
| Source: |
Springer Online Journal Archives 1860-2000
|
| Topics: |
Computer Science
|
| Notes: |
Summary The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to obtain the parse of the new input. The implementation is discussed: a suitable data structure and a version of the algorithm which operates upon it are introduced; finally the problem of realizing efficient incremental parsers is faced, showing a modification to the basic algorithm which enable the reanalysis to be performed in linear time.
|
| Type of Medium: |
Electronic Resource
|
| URL: |
| _version_ | 1798297658236862464 |
|---|---|
| autor | Celentano, A. |
| autorsonst | Celentano, A. |
| book_url | http://dx.doi.org/10.1007/BF00265676 |
| datenlieferant | nat_lic_papers |
| hauptsatz | hsatz_simple |
| identnr | NLM202565769 |
| iqvoc_descriptor_title | iqvoc_00000276:parsers |
| issn | 1432-0525 |
| journal_name | Acta informatica |
| materialart | 1 |
| notes | Summary The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to obtain the parse of the new input. The implementation is discussed: a suitable data structure and a version of the algorithm which operates upon it are introduced; finally the problem of realizing efficient incremental parsers is faced, showing a modification to the basic algorithm which enable the reanalysis to be performed in linear time. |
| package_name | Springer |
| publikationsjahr_anzeige | 1978 |
| publikationsjahr_facette | 1978 |
| publikationsjahr_intervall | 8024:1975-1979 |
| publikationsjahr_sort | 1978 |
| publisher | Springer |
| reference | 10 (1978), S. 307-321 |
| search_space | articles |
| shingle_author_1 | Celentano, A. |
| shingle_author_2 | Celentano, A. |
| shingle_author_3 | Celentano, A. |
| shingle_author_4 | Celentano, A. |
| shingle_catch_all_1 | Celentano, A. Incremental LR parsers Summary The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to obtain the parse of the new input. The implementation is discussed: a suitable data structure and a version of the algorithm which operates upon it are introduced; finally the problem of realizing efficient incremental parsers is faced, showing a modification to the basic algorithm which enable the reanalysis to be performed in linear time. 1432-0525 14320525 Springer |
| shingle_catch_all_2 | Celentano, A. Incremental LR parsers Summary The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to obtain the parse of the new input. The implementation is discussed: a suitable data structure and a version of the algorithm which operates upon it are introduced; finally the problem of realizing efficient incremental parsers is faced, showing a modification to the basic algorithm which enable the reanalysis to be performed in linear time. 1432-0525 14320525 Springer |
| shingle_catch_all_3 | Celentano, A. Incremental LR parsers Summary The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to obtain the parse of the new input. The implementation is discussed: a suitable data structure and a version of the algorithm which operates upon it are introduced; finally the problem of realizing efficient incremental parsers is faced, showing a modification to the basic algorithm which enable the reanalysis to be performed in linear time. 1432-0525 14320525 Springer |
| shingle_catch_all_4 | Celentano, A. Incremental LR parsers Summary The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to obtain the parse of the new input. The implementation is discussed: a suitable data structure and a version of the algorithm which operates upon it are introduced; finally the problem of realizing efficient incremental parsers is faced, showing a modification to the basic algorithm which enable the reanalysis to be performed in linear time. 1432-0525 14320525 Springer |
| shingle_title_1 | Incremental LR parsers |
| shingle_title_2 | Incremental LR parsers |
| shingle_title_3 | Incremental LR parsers |
| shingle_title_4 | Incremental LR parsers |
| sigel_instance_filter | dkfz geomar wilbert ipn albert fhp |
| source_archive | Springer Online Journal Archives 1860-2000 |
| timestamp | 2024-05-06T10:11:29.840Z |
| titel | Incremental LR parsers |
| titel_suche | Incremental LR parsers |
| topic | SQ-SU |
| uid | nat_lic_papers_NLM202565769 |