Incremental Parser Generation for Tree Adjoining Grammars

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 12 Postscript figures, uses fullname.sty

Scientific paper

This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far. In this paper, a lazy generation of LR-type parsers for TALs is defined in which parse tables are created by need while parsing. We then describe an incremental parser generator for TALs which responds to modification of the input grammar by updating parse tables built so far.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Incremental Parser Generation for Tree Adjoining Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Incremental Parser Generation for Tree Adjoining Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental Parser Generation for Tree Adjoining Grammars will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-458231

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.