Regular expression extension method and system for YAML and push-down automaton

Abstract

The invention discloses a regular expression extension method and system for a YAML and a push-down automaton, and the method comprises the steps: inputting a prefabricated command and a node in the YAML, constructing a YAML regular matching tree, and generating a regular matcher according to the regular matching tree; the nodes comprise variable definition nodes, variable reference nodes and variable expression nodes, and link is established between the variable definition nodes and the variable reference nodes; recursively matching prefabricated nodes through the regular matcher, and executing a prefabricated command according to the node type; constructing a push-down matching logic, and if the current node is successfully matched, executing matching state maintenance of the current node and the current child node according to the push-down matching logic and the prefabricated command; and reading all successfully matched variable expression node contents, and calling a corresponding regular expression from a regular expression library of the language according to the contents.

Description

technical field [0001] The invention relates to the technical field of computer code regular expressions, in particular to a regular expression extension method and system for YAML and pushdown automata. Background technique [0002] At present, there are two standards for traditional regular expressions. In addition to the POSIX standard, there is also a Perl standard. The POSIX standard is more classic and is also a built-in implementation of many other programming languages. The Perl standard has carried out basic regular expressions. Expansion, adding functions such as pattern recursive matching. However, neither the POSIX standard regular expressions nor the PCRE standard can solve the matching problem of patterns such as mutual reference and interrelated inclusion in strings. If you want to borrow such regular expressions to match a structured programming language, it is also very important complex. In addition, traditional regular expressions are also difficult to r...

AI Technical Summary

Problems solved by technology

However, neither the POSIX standard regular expressions nor the PCRE standard can solve the matching problems of mutual references, interrelated inclusions, etc. in strings. If you want to borrow such regular expressions to match a certain structured programming language, it is very difficult complex

In addition, traditional regular expressions are also difficult to read and understand, and difficult to maintain

Images