A Turing-complete language parsing system and parsing method based on cel and ml
A language analysis and language technology, applied in the computer field, can solve problems such as not having Turing completeness, and achieve the effects of friendly visual programming support, good readability, and strong language scalability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0047] The method of the present invention will be described in detail below in conjunction with specific embodiments and accompanying drawings.
[0048] The method of the present invention aims to provide a low-code platform with a convenient machine-generated intermediate language with Turing completeness; or to meet the logic scalability requirements of the software system written in Golang without introducing other programming languages The virtual machine, the present invention combines the ML (markup language) text markup language with the CEL general expression language, and realizes a set of programming language running in the Golang runtime that can interact with Golang in the Golang language.
[0049] The present invention realizes the Turing complete language analysis method based on CEL and ML and the process is as follows
[0050] 1. use ML text markup language as the language carrier of the present invention, have the characteristic of hierarchical structure by M...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com