A Turing-complete language parsing system and parsing method based on cel and ml

Abstract

The invention discloses a Turing-complete language analysis system and analysis method based on CEL and ML, adopting the following technical scheme: using text markup language as a language carrier, analyzing the hierarchical relationship in the language through the text markup language and dividing the language structure into It is a binary or multi-fork tree structure; analyze the language nodes and define the structure, and realize the tree structure by mutual reference to different structures; establish a branch if the condition is established, and judge whether it can satisfy the branch logic; execute the loop structure , judge and execute the loop structure of the structure according to the language node. The syntax tree in the present invention can be converted into general ML, which is supported by most languages ​​on the market, and a set of operating environments can be easily written in other languages, and has strong language expansibility.

Description

technical field [0001] The invention belongs to the field of computer technology, and in particular relates to a Turing complete language analysis system and analysis method based on CEL and ML. Background technique [0002] ML is the acronym for "Markup Language", that is, "markup language", CEL is the acronym for "common expression language", that is, "common expression language", cel is implemented by Google, and it is an embedded language. CEL implements The common semantics of expression calculation enables different applications to interoperate more easily, such as go and C++, by using CEL to unify expressions and ignore language differences. However, there is no concept of context in the CEL language itself. It depends on the host language and must be parsed at runtime in languages ​​such as go / c++. It lacks logical judgment and loop structure, cannot be used to express complex logic, and does not have Turing completeness. Contents of the invention [0003] The pur...

AI Technical Summary

Problems solved by technology

[0003] The purpose of the present invention is to solve the problem that cel does not have Turing completeness, so that it has the concept of context, supports conditional judgment branch statements, loop statements, and the definition of variables, thereby proposing a Turing complete language based on CEL and ML Analysis method and analysis system

Images