CN115061673A - Low-code visual expression based arranging and executing method and system - Google Patents
Low-code visual expression based arranging and executing method and system Download PDFInfo
- Publication number
- CN115061673A CN115061673A CN202210991824.4A CN202210991824A CN115061673A CN 115061673 A CN115061673 A CN 115061673A CN 202210991824 A CN202210991824 A CN 202210991824A CN 115061673 A CN115061673 A CN 115061673A
- Authority
- CN
- China
- Prior art keywords
- expression
- user
- built
- receiving
- function
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/34—Graphical or visual programming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/38—Creation or generation of source code for implementing user interfaces
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/448—Execution paradigms, e.g. implementations of programming paradigms
- G06F9/4482—Procedural
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Stored Programmes (AREA)
Abstract
The invention is suitable for the technical field of low codes, and provides a low-code visual expression based arranging and executing method and system, which comprises the following steps: receiving a visual expression configuration instruction input by a user, and performing page expression arrangement, workflow expression arrangement and data flow expression arrangement according to the visual expression configuration instruction to obtain a infix expression; converting the infix expression into a suffix expression based on an inverse Polish notation, and converting the suffix expression into a user built-in expression; the method comprises the steps of receiving a service function script and a user built-in expression calling command, directly calling the user built-in expression to execute the service function script to obtain a required operation result, supplementing the built-in expression at any time according to a newly increased requirement by a user, meeting application requirements of different users and different service scenes, reducing the difficulty of the user in using a low-code development platform to carry out service operation, effectively improving the usability of the low-code development platform and improving the working efficiency of the user.
Description
Technical Field
The invention relates to the technical field of low codes, in particular to a low-code visualization expression based arranging and executing method and system.
Background
The low code is a visual application program development method, can accelerate and simplify the development of application programs from small departments to large complex tasks, can realize cross-platform deployment after one development, and accelerates and simplifies the integration of the application programs, the cloud end, the local database and the recording system. The low-code development platform can realize the application requirement analysis, interface design, development, delivery and management of enterprise digitalization, and has the characteristics of quickness, agility and continuity.
At present, a general low-code development platform cannot support a function expression required by user-defined service modeling so as to meet application requirements of different users and different service scenes, further reduce the difficulty of service operation of the user by using the low-code development platform, and effectively improve the research in the aspects of working efficiency of the user and the like. Therefore, it is desirable to provide a method and system for arranging and executing expressions based on low-code visualization, which aims to solve the above problems.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a low-code visualization expression-based arranging and executing method and system, so as to solve the problems in the background art.
The invention is realized by the following steps that a low-code visualization expression-based arranging and executing method comprises the following steps:
receiving a visual expression configuration instruction input by a user,
performing page expression arrangement, workflow expression arrangement and data flow expression arrangement according to the visual expression configuration instruction to obtain a infix expression;
converting the infix expression into a suffix expression based on an inverse Polish notation, and converting the suffix expression into a user built-in expression;
and receiving a service function script and a user built-in expression calling command, and directly calling the user built-in expression to execute the service function script to obtain a required operation result.
As a further scheme of the invention: the page expression arrangement provides functions including drag, wire, anchor, auto-attract, and highlight.
As a further scheme of the invention: the functions provided by the workflow expression arrangement comprise parameter configuration, node configuration, model configuration, rule configuration and context configuration.
As a further scheme of the invention: the data flow expression arrangement provides functions including operators, constant nodes, variable nodes, function nodes and data source nodes.
As a further scheme of the invention: the step of converting the infix expression into the suffix expression based on the inverse Polish notation specifically includes:
receiving input user information and a user name, and enabling the user information and the user name to be stacked;
receiving an input function operator, performing function operation, and pressing an operation result into a stack after obtaining the operation result;
receiving a page variable and an arithmetic operator, enabling the page variable to be stacked, performing arithmetic operation, and stacking an arithmetic operation result;
receiving operators such as logics, performing logical operation on the two values at the top of the stack, and pressing the result into the stack;
and (4) receiving the suffix expression queue as null, taking a value, and returning the final operation result in the stack as the execution result of the expression.
As a further scheme of the invention: the method further comprises receiving built-in expression description information, and specifically comprises the following steps:
receiving built-in expression naming information input by a user;
and receiving the built-in expression function description input by the user, wherein the built-in expression naming information and the built-in expression function description together form built-in expression description information.
As a further scheme of the invention: the method further comprises the following steps:
performing semantic analysis on the expression function descriptions of all users to obtain function keywords;
classifying all the functional keywords, and determining the quantity value of the functional keywords in each class;
and when the quantity value reaches a set value, sending the corresponding function keyword to a developer end.
It is another object of the present invention to provide a low code visualization expression based orchestration and execution system, the system comprising:
an expression configuration instruction module for receiving the visual expression configuration instruction input by the user,
the expression arrangement module is used for carrying out page expression arrangement, workflow expression arrangement and data flow expression arrangement according to the visual expression configuration instruction to obtain a infix expression;
the built-in expression determining module is used for converting the infix expression into a suffix expression based on an inverse Polish notation and converting the suffix expression into a user built-in expression;
and the built-in expression calling module is used for receiving the service function script and a built-in expression calling command of the user and directly calling the built-in expression of the user to execute the service function script to obtain a required operation result.
As a further scheme of the invention: the built-in expression determination module includes:
the user information stacking unit is used for receiving the input user information and the user name so as to stack the user information and the user name;
the function operation unit is used for receiving an input function operator, performing function operation, and pressing an operation result into a stack after the operation result is obtained;
the arithmetic operation unit is used for receiving the page variables and the arithmetic operators, enabling the page variables to be stacked, performing arithmetic operation and stacking the arithmetic operation results;
the logic equal operation unit is used for receiving logic equal operators, performing logic equal operation on the two values at the top of the stack and then pressing the result into the stack;
and the expression execution result unit is used for receiving the suffix expression queue as null, taking a value and returning the final operation result in the stack as the execution result of the expression.
As a further scheme of the invention: the system also comprises an expression elaboration module, wherein the expression elaboration module specifically comprises:
the expression naming unit is used for receiving the built-in expression naming information input by a user;
and the expression function description unit is used for receiving the built-in expression function description input by the user, and the built-in expression naming information and the built-in expression function description jointly form built-in expression description information.
Compared with the prior art, the invention has the beneficial effects that:
the method can perform page expression arrangement, workflow expression arrangement and data flow expression arrangement according to a visual expression configuration instruction to obtain a infix expression, converts the infix expression into a suffix expression based on an inverse Polish notation, and converts the suffix expression into a user built-in expression; the built-in expression is directly called to execute the service function script during corresponding service processing to obtain an expected operation result, the built-in expression can be supplemented at any time according to a newly increased requirement, the application requirements of different users and different service scenes are met, the difficulty of using the low-code development platform to carry out service operation by the user is reduced, the usability of the low-code development platform is effectively improved, and the working efficiency and the working quality of the user are improved.
Drawings
FIG. 1 is a flow diagram of a method for orchestration and execution based on low code visualization expressions.
FIG. 2 is a flow chart of a method for arranging and executing expressions based on low code visualization, wherein the method converts a prefix expression into a suffix expression based on an inverse Polish notation.
FIG. 3 is a flow chart of receiving information describing a built-in expression in a low-code visualization expression based arranging and executing method.
FIG. 4 is a schematic diagram of a low code visualization expression based orchestration and execution system.
FIG. 5 is a schematic diagram of a built-in expression determination module in an arrangement and execution system based on low-code visual expressions.
FIG. 6 is a schematic diagram of a structure of an expression description module in an arrangement and execution system based on low-code visualization expressions.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more clear, the present invention is further described in detail below with reference to the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Specific implementations of the present invention are described in detail below with reference to specific embodiments.
As shown in fig. 1, an embodiment of the present invention provides a low-code visualization expression-based layout and execution method, including the following steps:
s100, receiving a visual expression configuration instruction input by a user,
s200, page expression arrangement, workflow expression arrangement and data flow expression arrangement are carried out according to the visual expression configuration instruction to obtain a infix expression;
s300, converting the infix expression into a suffix expression based on an inverse Polish notation, and converting the suffix expression into a user built-in expression;
s400, receiving the service function script and the user built-in expression calling command, and directly calling the user built-in expression to execute the service function script to obtain a required operation result.
It should be noted that the low code is a visual application development method, which can accelerate and simplify the development of applications from small departments to large complex tasks, realize cross-platform deployment in one development, and accelerate and simplify the integration of applications, cloud terminals, local databases, and recording systems. The low-code development platform can realize the application requirement analysis, interface design, development, delivery and management of enterprise digitalization, and has the characteristics of quickness, agility and continuity.
At present, a general low-code development platform cannot support a function expression required by user-defined service modeling so as to meet application requirements of different users and different service scenes, further reduce the difficulty of service operation performed by the user using the low-code development platform, and effectively improve the research in the aspects of user work efficiency and the like.
In the embodiment of the invention, when a user feels that an expression carried by a low-code program development platform cannot meet the service requirement of the user and needs to configure a function expression, a visual expression configuration instruction is directly input, and then page expression arrangement, workflow expression arrangement and data flow expression arrangement can be carried out to obtain a infix expression; in the embodiment of the invention, the functions provided by the page expression arrangement comprise dragging, connecting, anchoring, automatic adsorption and highlighting; the functions provided by the workflow expression arrangement comprise parameter configuration, node configuration, model configuration, rule configuration and context configuration; the data flow expression arrangement provides functions including operators, constant nodes, variable nodes, function nodes and data source nodes.
It should be noted that the constant node is always used as a leaf node in the tree structure, and is used as a data producer in the expression architecture, and when the expression tree is converted into an inverse wave-blue structure in the interpreter, the head of the queue is always the producer. The variable nodes are the same as the constant nodes, and are always used as leaf nodes in a tree structure designed by expression graphical layout, and the roles of data producers are different from the constants: the data of the variable nodes is variable and plays a role of a variation factor in the expression architecture, and the variation of the variable nodes in one expression can cause the reinterpretation execution of the whole expression. The function nodes are divided into pure functions and non-pure functions, the non-pure functions are divided into functions with parameters and functions without parameters, in the structural design of the expression, the pure functions have more than one parameter input, and the definition of the pure functions means that the functions need to generate the same output when the functions have the same input value. The output of the function is independent of other states or environments other than the input values and also independent of external outputs generated by the I/O device, and the function cannot have semantically observable functional side effects, such as "triggering events," causing output from the output device, or altering the contents of things other than the output values. The output of the pure function may not be related to all input values, or even may be unrelated to all input values, but the output of the pure function may not be related to anything other than the input values; the non-pure function can have zero to N parameters, and the value of the non-pure function is related to unknown factors such as the current environment, state and the like; the expression with parameter function is always non-leaf node in the tree structure of the expression graphic arrangement designer, when one parameter function is used as leaf node in the tree, the expression designer will prompt that the error report can not be stored, and the parameter-free function is always used as leaf node, and the status of the expression architecture is the same as constant, slightly different, the result of each time is the same in the process of recalculating the expression caused by the variation factor, and may be different from each other. The data source node is introduced from an entity, and essentially is a data structure obtained by screening and counting configuration conditions of a database table and screening fields. The data source node is similar to the variable node and is a variable factor in the expression, and the change of the data source node always causes the recalculation of the expression.
Converting the infix expression into a suffix expression based on an inverse Polish notation, and converting the suffix expression into a user built-in expression; the interpreter of the inverse Polish notation is generally stack-based, and the interpretation process is generally: stacking the operand; when an operational character is encountered, the operand is popped, evaluated and the result is pushed; after one pass, the top of the stack is the value of the expression. Therefore, the evaluation of the inverse Polish expression is easy to realize by using a stack structure and can be evaluated quickly; and finally, receiving a service function script input by a user and a user built-in expression calling command, and directly calling a corresponding user built-in expression to execute the service function script to obtain a required operation result.
As shown in fig. 2, as a preferred embodiment of the present invention, the step of converting the infix expression into the suffix expression based on the inverse bornance notation specifically includes:
s301, receiving input user information and a user name, and enabling the user information and the user name to be stacked;
s302, receiving an input function operator, performing function operation, and pressing an operation result into a stack after obtaining the operation result;
s303, receiving the page variables and the arithmetic operator, enabling the page variables to be stacked, performing arithmetic operation, and stacking the arithmetic operation result;
s304, receiving logical equal operators, performing logical equal operation on two values at the top of the stack, and pressing the result into the stack;
s305, receiving the suffix expression queue as empty, taking a value, and returning the final operation result in the stack as the execution result of the expression.
In the embodiment of the present invention, the idea based on the suffix expression is specifically modified into an expression calculation algorithm based on a low code scene, and the following description is implemented: the suffix expression "((page variable + Substr (user information. username, 3, 10)) = ToLower (GetUserld ())") to the queue of suffix expression operations is "user information" = >3= >10= > Substr (param 1, param2, param 3) = > page variable = > + = > GetUserld () = > ToLower (string) = >; the following table gives the algorithmic process evaluating from left to right, the stack column gives the intermediate values for the tracking algorithm:
as shown in fig. 3, as a preferred embodiment of the present invention, the method further includes receiving built-in expression description information, which specifically includes:
s501, receiving built-in expression naming information input by a user;
s502, receiving the built-in expression function description input by the user, wherein the built-in expression naming information and the built-in expression function description jointly form built-in expression description information.
In the embodiment of the invention, in order to facilitate the user to call the built-in expression subsequently, the user can carry out a command on the built-in expression and mark the functional description of the expression. In addition, the embodiment of the invention can automatically carry out semantic analysis on the expression function descriptions of all users to obtain the function keywords; classifying all the functional keywords, and determining the quantity value of the functional keywords in each class; and when the quantity value reaches a set value, the set value is a larger value, and the corresponding functional keyword is sent to the developer end. Therefore, the developer end can develop the self-contained expression corresponding to the functional keyword, and the low-code program development platform comprises the self-contained expression, so that the requirements of more users are met.
As shown in fig. 4, an embodiment of the present invention further provides a system for arranging and executing based on a low-code visualization expression, where the system includes:
an expression configuration instruction module 100, configured to receive a visual expression configuration instruction input by a user,
the expression arrangement module 200 is configured to perform page expression arrangement, workflow expression arrangement and data flow expression arrangement according to the visual expression configuration instruction to obtain a infix expression;
a built-in expression determining module 300, which converts the infix expression into a suffix expression based on the inverse Polish notation, and converts the suffix expression into a user built-in expression;
the built-in expression calling module 400 is configured to receive the service function script and the user built-in expression calling command, and directly call the user built-in expression to execute the service function script to obtain a required operation result.
In the embodiment of the invention, when a user feels that an expression carried by a low-code program development platform cannot meet the service requirement of the user and needs to configure a function expression, a visual expression configuration instruction is directly input, and then page expression arrangement, workflow expression arrangement and data flow expression arrangement can be carried out to obtain a infix expression; in the embodiment of the invention, the functions provided by the page expression arrangement comprise dragging, connecting, anchoring, automatic adsorption and highlighting; the functions provided by the workflow expression arrangement comprise parameter configuration, node configuration, model configuration, rule configuration and context configuration; the data flow expression arrangement provides functions including operators, constant nodes, variable nodes, function nodes and data source nodes. Converting the infix expression into a suffix expression based on an inverse Polish notation, and converting the suffix expression into a user built-in expression; the interpreter of the inverse Polish notation is generally stack-based, and the interpretation process is generally: stacking the operand; when an operational character is encountered, the operand is popped, evaluated and the result is pushed; after one pass, the top of the stack is the value of the expression. Therefore, the evaluation of the inverse Polish expression is easy to realize by using a stack structure and can be evaluated quickly; and finally, receiving a service function script input by a user and a user built-in expression calling command, and directly calling a corresponding user built-in expression to execute the service function script to obtain a required operation result.
As shown in fig. 5, as a preferred embodiment of the present invention, the built-in expression determining module 300 includes:
a user information stacking unit 301, configured to receive input user information and a user name, so that the user information and the user name are stacked;
the function operation unit 302 is configured to receive an input function operator, perform function operation, and push an operation result to a stack after obtaining the operation result;
an arithmetic operation unit 303, configured to receive the page variable and the arithmetic operator, stack the page variable, perform an arithmetic operation, and stack an arithmetic operation result;
the logical equal operation unit 304 is used for receiving logical equal operators, performing logical equal operation on the two values at the top of the stack, and then pressing the result into the stack;
and the expression execution result unit 305 is configured to receive the suffix expression queue as empty, take a value, and return the final operation result in the stack as the execution result of the expression.
In the embodiment of the present invention, the idea based on the suffix expression is specifically modified into an expression calculation algorithm based on a low code scene, and the following description is implemented: the suffix expression "((page variable + Substr (user information. username, 3, 10)) = ToLower (GetUserld ())") turns into the queue of suffix expression operation as "user information". username = >3= >10= > Substr (param 1, param2, param 3) = > page variable = > + = > GetUserld () = > ToLower (string) = >.
As shown in fig. 6, as a preferred embodiment of the present invention, the system further includes an expression elaboration module 500, where the expression elaboration module 500 specifically includes:
an expression naming unit 501, configured to receive the naming information of the built-in expression input by the user;
the expression function description unit 502 is configured to receive a built-in expression function description input by a user, where the built-in expression naming information and the built-in expression function description together form built-in expression description information.
In the embodiment of the invention, in order to facilitate the user to call the built-in expression subsequently, the user can carry out a command on the built-in expression and mark the functional description of the expression. In addition, the embodiment of the invention can automatically carry out semantic analysis on the expression function descriptions of all users to obtain the function keywords; classifying all the functional keywords, and determining the quantity value of the functional keywords in each class; and when the quantity value reaches a set value, the set value is a larger value, and the corresponding function keyword is sent to the developer end. Therefore, the developer end can develop the self-contained expression corresponding to the functional keyword, and the low-code program development platform comprises the self-contained expression, so that the requirements of more users are met.
The present invention has been described in detail with reference to the preferred embodiments thereof, and it should be understood that the invention is not limited thereto, but is intended to cover modifications, equivalents, and improvements within the spirit and scope of the present invention.
It should be understood that, although the steps in the flowcharts of the embodiments of the present invention are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in various embodiments may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (10)
1. A low-code visualization expression based orchestration and execution method, the method comprising the steps of:
receiving a visual expression configuration instruction input by a user,
performing page expression arrangement, workflow expression arrangement and data flow expression arrangement according to the visual expression configuration instruction to obtain a infix expression;
converting the infix expression into a suffix expression based on an inverse Polish notation, and converting the suffix expression into a user built-in expression;
and receiving a service function script and a user built-in expression calling command, and directly calling the user built-in expression to execute the service function script to obtain a required operation result.
2. The low-code visualization expression-based orchestration and execution method according to claim 1, wherein the page expression orchestration provides functions including drag, join, anchor, auto-adsorption, and highlighting.
3. The method for orchestration and execution based on low code visualization expressions according to claim 1, wherein the functions provided by the workflow expression orchestration include parameter configuration, node configuration, model configuration, rule configuration, and context configuration.
4. The method for orchestration and execution based on low code visualization expressions according to claim 1, wherein the functions provided by data flow expression orchestration include operators, constant nodes, variable nodes, function nodes, and data source nodes.
5. The method for arranging and executing expressions based on low code visualization as claimed in claim 1, wherein the step of converting the infix expression into the suffix expression based on the inverse Polish notation specifically comprises:
receiving input user information and a user name, and enabling the user information and the user name to be stacked;
receiving an input function operator, performing function operation, and pressing an operation result into a stack after obtaining the operation result;
receiving a page variable and an arithmetic operator, enabling the page variable to be stacked, performing arithmetic operation, and stacking an arithmetic operation result;
receiving operators such as logics, performing logical operation on the two values at the top of the stack, and pressing the result into the stack;
and (4) receiving the suffix expression queue as null, taking a value, and returning the final operation result in the stack as the execution result of the expression.
6. The method for arranging and executing the low-code visualization expression based on the claim 1, wherein the method further comprises receiving the built-in expression description information, and specifically comprises:
receiving built-in expression naming information input by a user;
and receiving the built-in expression function description input by the user, wherein the built-in expression naming information and the built-in expression function description jointly form built-in expression description information.
7. The method of claim 6, wherein the method further comprises:
performing semantic analysis on the expression function descriptions of all users to obtain function keywords;
classifying all the functional keywords, and determining the quantity value of the functional keywords in each class;
and when the quantity value reaches a set value, sending the corresponding function keyword to a developer end.
8. A low code visualization expression based orchestration and execution system, the system comprising:
an expression configuration instruction module for receiving the visual expression configuration instruction input by the user,
the expression arrangement module is used for carrying out page expression arrangement, workflow expression arrangement and data flow expression arrangement according to the visual expression configuration instruction to obtain a infix expression;
the built-in expression determining module is used for converting the infix expression into a suffix expression based on an inverse Polish notation and converting the suffix expression into a user built-in expression;
and the built-in expression calling module is used for receiving the service function script and a built-in expression calling command of the user and directly calling the built-in expression of the user to execute the service function script to obtain a required operation result.
9. The low-code visualization expression-based orchestration and execution system according to claim 8, wherein the built-in expression determination module comprises:
the user information stacking unit is used for receiving the input user information and the user name so as to stack the user information and the user name;
the function operation unit is used for receiving an input function operator, performing function operation, and pressing an operation result into a stack after the operation result is obtained;
the arithmetic operation unit is used for receiving the page variables and the arithmetic operators, enabling the page variables to be stacked, performing arithmetic operation and stacking the arithmetic operation results;
the logic equal operation unit is used for receiving logic equal operators, performing logic equal operation on the two values at the top of the stack and then pressing the result into the stack;
and the expression execution result unit is used for receiving the suffix expression queue as null, taking a value and returning the final operation result in the stack as the execution result of the expression.
10. The low-code visualization expression-based orchestration and execution system according to claim 8, further comprising an expression elaboration module, wherein the expression elaboration module specifically comprises:
the expression naming unit is used for receiving the built-in expression naming information input by a user;
and the expression function description unit is used for receiving the built-in expression function description input by the user, and the built-in expression naming information and the built-in expression function description jointly form built-in expression description information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210991824.4A CN115061673A (en) | 2022-08-18 | 2022-08-18 | Low-code visual expression based arranging and executing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210991824.4A CN115061673A (en) | 2022-08-18 | 2022-08-18 | Low-code visual expression based arranging and executing method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115061673A true CN115061673A (en) | 2022-09-16 |
Family
ID=83207582
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210991824.4A Pending CN115061673A (en) | 2022-08-18 | 2022-08-18 | Low-code visual expression based arranging and executing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115061673A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116610305A (en) * | 2023-07-19 | 2023-08-18 | 湖南云畅网络科技有限公司 | Expression arrangement method, system and storage medium for clamping groove adsorption type |
| CN117270838A (en) * | 2023-11-22 | 2023-12-22 | 太平金融科技服务（上海）有限公司 | Method, device, equipment and medium for generating universal formula script |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6715130B1 (en) * | 1998-10-05 | 2004-03-30 | Lockheed Martin Corporation | Software requirements metrics and evaluation process |
| CN1877523A (en) * | 2006-06-23 | 2006-12-13 | 清华大学 | Method for unified management of component library supporting heterogeneous component |
| US20090100360A1 (en) * | 2007-10-12 | 2009-04-16 | Business Objects, S.A. | Apparatus and method for creating expressions |
| US20100162210A1 (en) * | 2008-12-22 | 2010-06-24 | International Business Machines Corporation | Visual Editor for Editing Complex Expressions |
| US20160070451A1 (en) * | 2014-09-05 | 2016-03-10 | Tableau Software, Inc. | Graphical User Interface that Simplifies User Creation of Custom Calculations for Data Visualizations |
| CN109324787A (en) * | 2017-08-18 | 2019-02-12 | 深圳怡化电脑股份有限公司 | A kind of business software development approach, device and terminal device |
| CN109582561A (en) * | 2018-10-16 | 2019-04-05 | 阿里巴巴集团控股有限公司 | A kind of adjustment method and device of online visual programming |
| CN110175027A (en) * | 2019-05-14 | 2019-08-27 | 广州衡昊数据科技有限公司 | A kind of method and apparatus for developing business function |
| CN111580806A (en) * | 2020-04-10 | 2020-08-25 | 天津大学 | Collaborative robot graphical programming system |
| CN114089986A (en) * | 2021-11-23 | 2022-02-25 | 浩云科技股份有限公司 | Method, system, device and medium for configuring low code development platform function expression |
-
2022
- 2022-08-18 CN CN202210991824.4A patent/CN115061673A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6715130B1 (en) * | 1998-10-05 | 2004-03-30 | Lockheed Martin Corporation | Software requirements metrics and evaluation process |
| CN1877523A (en) * | 2006-06-23 | 2006-12-13 | 清华大学 | Method for unified management of component library supporting heterogeneous component |
| US20090100360A1 (en) * | 2007-10-12 | 2009-04-16 | Business Objects, S.A. | Apparatus and method for creating expressions |
| US20100162210A1 (en) * | 2008-12-22 | 2010-06-24 | International Business Machines Corporation | Visual Editor for Editing Complex Expressions |
| US20160070451A1 (en) * | 2014-09-05 | 2016-03-10 | Tableau Software, Inc. | Graphical User Interface that Simplifies User Creation of Custom Calculations for Data Visualizations |
| CN109324787A (en) * | 2017-08-18 | 2019-02-12 | 深圳怡化电脑股份有限公司 | A kind of business software development approach, device and terminal device |
| CN109582561A (en) * | 2018-10-16 | 2019-04-05 | 阿里巴巴集团控股有限公司 | A kind of adjustment method and device of online visual programming |
| CN110175027A (en) * | 2019-05-14 | 2019-08-27 | 广州衡昊数据科技有限公司 | A kind of method and apparatus for developing business function |
| CN111580806A (en) * | 2020-04-10 | 2020-08-25 | 天津大学 | Collaborative robot graphical programming system |
| CN114089986A (en) * | 2021-11-23 | 2022-02-25 | 浩云科技股份有限公司 | Method, system, device and medium for configuring low code development platform function expression |
Non-Patent Citations (7)
| Title |
|---|
| 凌乙: "无代码解决方案：如何彻底实现无代码化研发模式", 《HTTPS://TECH.TAOBAO.ORG/NEWS/MK3D67》 * |
| 张成等: "基于构件库/工作流的可视化软件开发", 《计算机工程与应用》 * |
| 曾水根等: "基于逆波兰算法实现的电力故障数据分析公式编辑器", 《电气应用》 * |
| 罗晓茜等: "实时***构件模型及构件库研究", 《计算机时代》 * |
| 苏小红: "《程序设计实践教程C语言版》", 31 December 2021, 机械工业出版社 * |
| 郭洪波等: "基于Web Service的组件管理***", 《信息技术》 * |
| 陆泉: "《基于大数据挖掘的医疗健康公共服务》", 30 June 2020, 武汉大学出版社 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116610305A (en) * | 2023-07-19 | 2023-08-18 | 湖南云畅网络科技有限公司 | Expression arrangement method, system and storage medium for clamping groove adsorption type |
| CN116610305B (en) * | 2023-07-19 | 2023-09-19 | 湖南云畅网络科技有限公司 | Expression arrangement method, system and storage medium for clamping groove adsorption type |
| CN117270838A (en) * | 2023-11-22 | 2023-12-22 | 太平金融科技服务（上海）有限公司 | Method, device, equipment and medium for generating universal formula script |
| CN117270838B (en) * | 2023-11-22 | 2024-02-13 | 太平金融科技服务（上海）有限公司 | Method, device, equipment and medium for generating universal formula script |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20230385033A1 (en) | Storing logical units of program code generated using a dynamic programming notebook user interface | |
| AU2005202285B2 (en) | Method, system, and apparatus for providing access to workbook models through remote function calls | |
| CN115061673A (en) | Low-code visual expression based arranging and executing method and system | |
| CN109032662B (en) | Code file generation method and device, computer equipment and storage medium | |
| CN112199086A (en) | Automatic programming control system, method, device, electronic device and storage medium | |
| CN112988130A (en) | Visual modeling method, device, equipment and medium based on big data | |
| CN105824974A (en) | Method and system for analyzing and processing data | |
| CN113379070A (en) | Deep learning framework conversion method, system, storage medium and equipment | |
| WO2023160290A1 (en) | Neural network inference acceleration method, target detection method, device, and storage medium | |
| CN115543290A (en) | Visual programming method and system | |
| CN107851002A (en) | A kind of code compiling method and code encoder | |
| CN114064026A (en) | Business processing model generation method and device, electronic equipment and storage medium | |
| WO2022141489A1 (en) | Deep learning model reasoning method and apparatus, computer device, and storage medium | |
| US11023101B2 (en) | System and method for implementing a self service machine learning framework | |
| CN114449063B (en) | Message processing method, device and equipment | |
| US20160335331A1 (en) | System and method for providing climate data analytics as a service | |
| Stetsenko et al. | Petri-object simulation: technique and software | |
| US20220350574A1 (en) | Code injection from natural language derived intent | |
| CN115033212A (en) | Avionics system primitive model integrated construction method and device and computer equipment | |
| CN110377934B (en) | Design calculation method and device for marine electromechanical product | |
| CN110502483A (en) | Data processing method, device, computer equipment and storage medium | |
| CN116755714B (en) | Method, device, equipment and storage medium for operating deep neural network model | |
| CN109857393B (en) | Visual realization method and device of sequence control chart and storage medium | |
| US20230297346A1 (en) | Intelligent data processing system with metadata generation from iterative data analysis | |
| US20210373920A1 (en) | Method of searching for object for executing automation scenario and apparatus for performing the method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220916 |