Modular parser generation
J. Rekers · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1989
We consider a parser generator MPG for grammars having a modular structure.Each grammar module contains a partial or incomplete granmar, which has to be supplemented with the grammars defined by the modules imported in It.MPG generates a parser for each module by generating a parser for the union of a given set of modules In such a way that parsers for the individual modules can be selected from it.This yields a separate parser for each module which Is as efficient as a conventionally generated one, while the generation work Invested In it can be re-used for other modules.The generator works fully In- crementally, as a modification of the grarnrnar is propagated to all parsers whose generation depends on it.