Research In Highly Extensible Recursively Enumerable Language Parser

With the rapid evolution of telecommunication technology, some design patterns are widely used for solving various problems in this field. As a result, experts introduce many describing languages, which cause many parsers being important toolkits in telecommunication projects, to make these patterns more workable. The parsers are very helpful in many cases, but for the sake of cost, these parsers could not satisfy special projects, therefore, engineers are eager to master the theory of parsers and develop their own parser. Unfortunately, engineers should learn hard-core theories of Computer Science and Math, which is difficult for them. Thus, only a highly extensible and engineering-oriented parser could solve these problems.In my research, a new parser model, which base on the typical process of the recursively enumerable language parser, is introduced, and the ability of this model is proved. In order to control this model, I create a new syntax named RBNF, and prove it that can work. Through the project in real life, this model has been considered valuable.In this research, I design an architecture, in which "parser", "semantic actions" and "code generation" are divided into three independent modules. This architecture is simply and extensible. And the implementation of the architecture, which makes good use of many design patterns and refactory patterns, is also highly extensible.Because my research is quite new, it will be the trend of telecommunication.