能率のよいトップダウン型構文解析プログラムの自動作成について

概要

論文の詳細を見る
A Syntax Analysis Program for LL(k)grammar by means of the top-down method is easy to understand.It can easily be linked to Semantic Programs and be modified when the syntactic structure has to be changed.On the contrary,it could only deal with simple languages;it was hardly employed in order to construct compilers for Practical languages,e.g.FORTRAN.In the Present report,an algorithm will be offered for an automatic generater of Syntatlx Analysis Program for anextended LL(k)grammar.An optimization algorithm for a generated program will also be offered.in the Progzam,no Pattern-matchings are required for nonterminal symbols.Finally,the algorithm will be extended so that keeping the cleanness of the top-down method,it may deal with the Syntax Analysis of Fortran.A simple example of the extended algorithm is also given.
一般社団法人情報処理学会の論文
1975-03-15