[Q] Encapsulated parsers

collins@cs.wm.edu (Bob Collins)
24 Nov 1998 22:26:54 -0500

          From comp.compilers

Related articles
[Q] Encapsulated parsers collins@cs.wm.edu (1998-11-24)
Re: [Q] Encapsulated parsers jamz@my-dejanews.com (1998-11-30)
Re: [Q] Encapsulated parsers cfc@world.std.com (Chris F Clark) (1998-11-30)
Re: [Q] Encapsulated parsers martin.jourdan@directprovider.net (1998-11-30)
Re: [Q] Encapsulated parsers collins@cs.wm.edu (1998-12-01)
| List of all articles for this month |

From: collins@cs.wm.edu (Bob Collins)
Newsgroups: comp.compilers
Date: 24 Nov 1998 22:26:54 -0500
Organization: Computer Science @ William & Mary
Keywords: parse, question, comment

Does anyone know of any research on what I call
encapsulated parsers, which consists of
      1. a single parse routine that accepts
      2. a. a set of parse tables,
                  b. a synthesize semantics routine, and
                  c. semantic routines to disambiguate
                        grammar conflicts at runtime
            as parameters,
      3. so that the parser can be called multiply
            in code with different parameters to parse
            the same input in different ways.

An example of 3 is
                  Parse_database (Phase_1_parse_tables,
            until Finished;
            Parse_database (Phase_2_parse_tables,


Bob Collins <mailto:collins@cs.wm.edu> <http://ratbert.cs.wm.edu>
[I think some of the C++-ized yaccs might be persuaded to do that. -John]

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.