[Q] Encapsulated parsers

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
            Get_working_database;
            loop
                  Parse_database (Phase_1_parse_tables,
                                                  Phase_1_semantics_routines,
                                                  Finished);
            until Finished;
            Parse_database (Phase_2_parse_tables,
                                            Phase_2_semantics_routines,
                                            Finished);
            Replace_woprking_database;


Thanks.


--
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]

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