亜順序文法とその構文解析法

概要

論文の詳細を見る
Regular-type sequential grammars and quasi-sequential grammars are proposed as belonging to the class of generative grammars which can describe FORTRAN IV. Regular-type sequential grammars are defined by giving some restrictions to the sequential grammars, and those restrictions are that regular-type sequential grammars have no self-embedding properties and that their parsing processes are deterministic. Quasi-sequential grammars are defined as an extension of regular-type sequential grammars by attatching the production rules with self-embedding properties by special methods described in this paper. The parsing processes for these grammars are executed as folloiws: The set of production rules is classified into ordered subsets, and scanning-reduction process is devided into the number of quotient sets, At each process, only one subset in the set of production rules is used. Henceforce, the size of the syntax table is much decreased. The authors are aiming to apply this theory to the compiler-compiler for the FORTRAN-type programming languages.
一般社団法人情報処理学会の論文
1973-12-15