A Practical Processor for a Programming Language Based on Coupled Contex-Free Grammar

点击翻译按钮获取中文摘要

A CCFG (Coupled Context-Free Grammar) is a grammar defined by coupling several CFGs (Context-Free Grammars). Each component CFG defines a data structure, and the CCFG can be regarded as a program (called CCFG program) that describes the relation between these data structures. Because a CCFG program is a combination of several grammars, the execution of the program corresponds to the parsing of these grammars. The following two methods for execution of CCFG programs have been developed :(1) Top-down execution that corresponds to LL parsing(2) Bottom-up execution that corresponds to LR parsingA CCFG program can also be considered as, or can easily be transformed into, an attribute grammar that has one or more input grammars. Therefore, a compiler generator based on attribute grammars can be applied as a compiler for such a program. If a CCFG program has two input grammars, then the target program has two parsers with attribute evaluators that run concurrently. In an actual implementation that we have developed, however, they run as two coroutines.