CN108664238A - A kind of execution method and device of explanation type script C-SUB - Google Patents
A kind of execution method and device of explanation type script C-SUB Download PDFInfo
- Publication number
- CN108664238A CN108664238A CN201810488974.7A CN201810488974A CN108664238A CN 108664238 A CN108664238 A CN 108664238A CN 201810488974 A CN201810488974 A CN 201810488974A CN 108664238 A CN108664238 A CN 108664238A
- Authority
- CN
- China
- Prior art keywords
- sub
- script
- expression formula
- explanation type
- expression
- 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
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 16
- 238000013459 approach Methods 0.000 claims description 6
- 230000007613 environmental effect Effects 0.000 claims description 3
- 238000010276 construction Methods 0.000 claims 1
- 230000006870 function Effects 0.000 description 39
- 239000011800 void material Substances 0.000 description 15
- 230000008569 process Effects 0.000 description 6
- 150000001875 compounds Chemical class 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 239000000203 mixture Substances 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 101100517651 Caenorhabditis elegans num-1 gene Proteins 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000012905 input function Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010561 standard procedure Methods 0.000 description 1
- 239000000725 suspension Substances 0.000 description 1
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/31—Programming languages or programming paradigms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformation of program code
- G06F8/41—Compilation
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Devices For Executing Special Programs (AREA)
Abstract
The present invention proposes a kind of execution method and device of explanation type script C SUB, and calculating is executed by using recursive algorithm traversal syntax tree；Compared to the execution method and device of existing explanation type script, method and device proposed by the invention has following features：The features such as lightweight, autgmentability are strong, transplanting is simple, implementation procedure is simplified, execution efficiency is high.
Description
Technical field
The present invention relates to field of computer technology, and in particular to the execution method of explanation type script C-SUB a kind of and
Device.
Background technology
In the prior art, it in the simulation computing system of intelligent substation, such as in power system real-time simulation calculating, needs
The equipment to be emulated has many parameters, and these parameters are when simulation calculation and user show, and needs to carry out parameter from famous
It is worth the conversion of per unit value or opposite direction, conversion formula is also very complicated, computationally intensive.However, existing script is opposite
In Embedded explanation execution, there are some inconveniences：
1, software volume is big, can increase more overheads；
2, transplanting is inconvenient, needs to be adapted to and solve the problems, such as more；
3, this typical executive mode causes script to be subjected to script parsing and operator parsing in the process of running
Process, it is low so as to cause script execution efficiency.；
4, the low execution efficiency for being also limited by virtual machine of the execution efficiency of script, inefficient virtual machine or internal algorithm can be tight
Ghost image rings script runnability.
Invention content
In order to solve the above-mentioned technical problem, the present invention proposes a kind of execution method and device of explanation type script C-SUB.
The present invention uses following technical scheme：
A kind of execution method of explanation type script C-SUB, includes the following steps：
Syntax tree is constructed, the expression formula of mathematical computations is obtained, generates script file；
It initializes the computing system of the expression formula and the initial guess of the expression formula is set；
Execute the script file after the initialization.
Preferably, in the present invention, the syntax tree is constructed using precedence of operator analytic approach with recursive algorithm.
Preferably, in the present invention, the syntax tree can be constructed further, and minimum operation is determined using the recursive algorithm
Symbol, and using the minimum operator as root, further constructed respectively in the left side of the minimum operator and right side.
Preferably, in the present invention, each node that the syntax tree is accessed using postorder traversal mode, that is, obtain number
Learn the expression formula calculated.
Preferably, in the present invention, using stack as the parking space of provisional parameter.
In addition, the present invention also provides a kind of executive device of explanation type script C-SUB, specifically include：
Parsing module obtains the expression formula of mathematical computations, generates the script file that can be run for constructing syntax tree；
For initializing expression computing system and the environmental variance initial value of the expression formula is arranged in initialization module；
Execution module, for executing the script file.
Preferably, in the present invention, the syntax tree is constructed using precedence of operator analytic approach with recursive algorithm.
Preferably, in the present invention, the parsing module includes constructing module, for the further structure of the syntax tree
It makes；Wherein, the constructing module determines minimum operator using the recursive algorithm, and using the minimum operator as root,
The left side of the minimum operator further constructs respectively with right side.
Preferably, in the present invention, each node that the syntax tree is accessed using postorder traversal mode, that is, obtain number
Learn the expression formula calculated.
Preferably, in the present invention, using stack as the parking space of provisional parameter.
Advantageous effects of the present invention
The present invention proposes a kind of execution method and device of explanation type script C-SUB, is traversed by using recursive algorithm
Production tree executes calculating；Compared to existing explanation type script, method and device proposed by the invention has following features：
1. lightweight：It is write with standard C language and is opened with source code form, and several K are only only taken up after compiling, can be very convenient
The other program of insertion in；
2. expansible：C-SUB provides the expansion interface for being highly susceptible to using and mechanism：By host language (being typically C or C++)
There is provided these functions, C-SUB can use them, be like natively built-in function；
3. transplanting is simple：Relevant C-SUB.h and C-SUB.c files only need to be introduced in software project, without additional
Transplant work；
4. implementation procedure simplifies, simplify the processing procedure of C-SUB, save memory space, without selecting other script interpretations
Program will generate instruction, then execute these instructions in virtual machine again.
Figure of description
Fig. 1 is flow chart in one embodiment of the invention；
Fig. 2 is function structure chart in one embodiment of the invention；
Fig. 3 is grammer dendrogram in one embodiment of the invention.
Specific implementation mode
By using recursive algorithm traverse production tree execute calculate, it can be achieved that a kind of lightweight, expansible, transplanting is simple,
The execution method and device for the explanation type script C-SUB that implementation procedure simplifies.The present invention proposes a kind of explanation type script
The execution method and device of language C-SUB, is described in detail below in conjunction with the accompanying drawings.
As shown in Figure 1, a kind of execution method of explanation type script C-SUB, includes the following steps：
Syntax tree is constructed, the expression formula of mathematical computations is obtained, generates script file；
It initializes the computing system of the expression formula and the initial guess of the expression formula is set；
Execute the script file after the initialization.
Preferably, in the present invention, the syntax tree is constructed using precedence of operator analytic approach with recursive algorithm.
Preferably, in the present invention, the syntax tree can be constructed further, and minimum operation is determined using the recursive algorithm
Symbol, and using the minimum operator as root, further constructed respectively in the left side of the minimum operator and right side.
Preferably, in the present invention, each node that the syntax tree is accessed using postorder traversal mode, that is, obtain number
Learn the expression formula calculated.
Preferably, in the present invention, using stack as the parking space of provisional parameter.
In addition, the present invention also provides a kind of executive devices of explanation type script C-SUB, as shown in Fig. 2, specific packet
It includes：
Parsing module obtains the expression formula of mathematical computations, generates the script file that can be run for constructing syntax tree；
For initializing expression computing system and the environmental variance initial value of the expression formula is arranged in initialization module；
Execution module, for executing the script file.
Preferably, in the present invention, the syntax tree is constructed using precedence of operator analytic approach with recursive algorithm.
Preferably, in the present invention, the parsing module includes constructing module, for the further structure of the syntax tree
It makes；Wherein, the constructing module determines minimum operator using the recursive algorithm, and using the minimum operator as root,
The left side of the minimum operator further constructs respectively with right side.
Preferably, in the present invention, each node that the syntax tree is accessed using postorder traversal mode, that is, obtain number
Learn the expression formula calculated.
Preferably, in the present invention, using stack as the parking space of provisional parameter.
Embodiment 1
C-SUB proposed by the invention is the interpreted languages of a lightweight, it includes integer variable, integer array and letter
Number（Including process or do-nothing function）；It also has part, the overall situation（It is static）Illustrate and（Simply）Recursive function, in addition there are i f languages
Sentence and w h i l e sentences；In addition to this almost whatever without.Program is made of the sequence of function and variable declaration sequence.
Program listing 1-2 is a program example in C-SUB, the factorial write wherein by recursive function
Program.The input/output of the program is provided by a r e a d function, and additionally there are one the C function s c according to standard
The w r i t e functions that a n f and p r i n t f are defined.
Factorials of the program listing 1-2 mono- with its input is the C-SUB programs of output
int fact(int x)
{
if (x > 1)
return x * fact(x - x);
else
return 1;
}
void main(void)
{
int x;
x = read();
if (x > 0) write(fact(x));
}
Explanation type C-SUB is a fairly simple language, it, which need not be compiled, need not also generate code；It also need not be virtual
Machine.Here is the design of explanation type C-SUB language.
Lexical scan program
Lexical scan program is completed for source program to be pronounced character file and is classified as several marks using lex tools
Lexical scan process.
1. being the keyword of language below：
else if int return void while
All keywords are all reserved words, and must be small letters.
2. being below special symbol：
+ - * / < <= > >= == != = ; , ( ) [ ] { } /* */
3. other labels are ID and NUM, defined by following regular expression：
ID = letter letter*
NUM = digit digit*
letter = a|..|z|A|..|Z
digit = 0|..|9
Lower case and upper case letter is distinguishing.
4. space is made of blank, newline and tab.Space is typically ignored, in addition to it must separate I D, N
U M keywords.
5. annotation is fenced up with common C language symbol/* */.Annotation, which can be placed on any blank, to be occurred
Position (i.e. annotation cannot be placed in label) on, and can be more than a line.Annotation cannot be nested.（Including process or empty letter
Number）；It also has part, the overall situation（It is static）Illustrate and（Simply）Recursive function, in addition there are i f sentences and w h i l e languages
Sentence；In addition to this almost whatever without.Program is made of the sequence of function and variable declaration sequence.
Syntax and semantics
C-SUB completes syntactic analysis using yacc tools, generates the data structure of abstract syntax tree.
The B N F grammers of C-SUB are as follows：
1.program→declaration-list
2.declaration-list→declaration-listdeclaration|declaration
3.declaration→var-declaration|fun-declaration4.var-declaration→type-
specifierID;|type-specifierID[NUM];
5.type-specifier→int|void
6.fun-declaration→type-specifierID(params)|compound-stmt
7.params→params-list|void
8.param-list→param-list,param|param
9.param→type-specifierID|type-specifierID[]
10.compound-stmt→{local-declarationsstatement-list}
11.local-declarations→local-declarationsvar-declaration|empty
12.statement-list→statement-liststatement|empty
13.statement→expression-stmt|compound-stmt|selection-stmt
|iteration-stmt|return-stmt
14.expression-stmt→expression;|;
15.selection-stmt→if(expression)statement
|if(expression)statementelsestatement
16.iteration-stmt→while(expression)statement
17.return-stmt→return;|returnexpression;
18.expression→var=expression|simple-expression
19.var→ID|ID[expression]
20.simple-expression→additive-expressionrelopadditive-expression
|additive-expression
21.relop→<=|<|>|>=|==|!=
22.additive-expression→additive-expressionaddopterm|term
23.addop→+|-
24.term→termmulopfactor|factor
25.mulop→*|/
26.factor→(expression)|var|call|NUM
27.call→ID(args)
28.args→arg-list|empty
29.arg-list→arg-list,expression|expression
To above every grammar rule, the short explanation of related semanteme is given.
1.program→declaration-list
2.declaration-list→declaration-listdeclaration|declaration
3.declaration→var-declaration|fun-declaration
Program is made of the list (or sequence) stated, statement can be function or variable declarations, sequentially be arbitrary.At least must
There are one statements for palpus.Followed by semantic restriction (these are not in C).All variables and function are using preceding necessary
Statement.Last statement must be a function declaration, name main in program.Note that C-SUB lacks prototype, therefore sound
It is bright to be not different (as C) between definition.
4.var-declaration→type-specifierID;|type-specifierID[NUM];
5.type-specifier→int|void
Variable declarations state simple integer type variable or base type as the aray variable of integer, index model
It encloses from 0 to NUM-1.Note that only fundamental type is integer and void type in C-SUB.In a variable declarations, only
It can usage type indicator int.Void is used for function declaration (see below).It is also to be noted that each statement can only state one
Variable.
6.fun-declaration→type-specifierID(params)compound-stmt
7.params→param-list|void
8.param-list→param-list,param|param
9.param→type-specifierID|type-specifierID[]
Function declaration by return type indicator, identifier and being formed with the parameter list that comma separates in round parentheses,
It is followed by a compound statement, is the code of function.If the return type of function is void, function does not return any
Value (being a process).The parameter of function can be the parameter of void (i.e. no parameter) or a row described function.Parameter
It is array parameter to be followed by square brackets, and size is variable.Simple argument of type integer is transmitted by value.Array parameter is by quoting
(namely pointer) is transmitted, must be matched by aray variable when calling.Note that type " function " does not have parameter.One
The action scope of a function parameter is equal to the compound statement of function declaration, and all there are one independent parameter sets for each request of function.
Function can be recursive (for the range for using statement to allow).
10.compound-stmt→{local-declarationsstatement-list}
Compound statement is made of the one group of statement to be fenced up with brace and sentence.Compound statement with given sequence by being executed
Statement sequence executes.The action scope locally stated is equal to the sentence list of compound statement, and replaces any global statement.
11.local-declarations→local-declarationsvar-declaration|empty
12.statement-list→statement-liststatement|empty
Notice that statement and sentence list can be that empty (nonterminal symbol empty indicates null character string, writes sometimes.)
13.statement→expression-stmt
|compound-stmt
|selection-stmt
|iteration-stmt
|return-stmt
14.expression-stmt→expression;|;
Expression formula that is optional and being followed by branch that there are one expression statements.Such expression formula usually finds out their sides
Result.Therefore, this sentence is used for assignment and function call.
15.selection-stmt→if(expression)statement
|if(expression)statementelsestatement
If sentences have common semanteme：Expression formula is calculated；Non-zero value causes the execution of first statement；0 value causes Article 2
The execution of sentence, if it exists.This rule results in typical suspension else ambiguity, can use a kind of standard
Method solves：It is analyzed immediately (" nested recently " non-ambiguity rule) usually as a minor structure of current if the parts else.
16.iteration-stmt→while(expression)statement
While statement is unique repeat statement in C-SUB.It repeats expression formula, and IF expression evaluates as
It is non-zero, then sentence is executed, is terminated when the value of expression formula is 0.
17.return-stmt→return;|returnexpression;
Return statement can return to a value and can also be returned without value.Function does not illustrate to be that void just must return to a value.Letter
Number is claimed as void just without return value.Return causes control to return to caller (if it in main, EP (end of program)).
18.expression→var=expression|simple-expression
19.var→ID|ID[expression]
Expression formula is a variable reference, is followed by assignment (equal sign) and an expression formula or one simple
Expression formula.Assignment has common storage semantic：It finds by the address of the var variables indicated, then by the son on assignment symbol the right
Expression formula carries out evaluation, and the value of subexpression is stored to given address.This value is also returned as the value of entire expression formula.
Var is simple (integer) variable or subscript aray variable.Negative subscript will cause program stopped (different from C).However, not into
Row subscript out of bounds inspection.
Var indicates the further limitation of C-SUB ratios C.The target of assignment must be lvalue (l-value) in C, and lvalue is
The address that can be obtained by many operations.Unique lvalue is given by var grammers in C-, thus this type according to
Syntax is checked, instead of the type checking as in C.Therefore pointer operation is forbidden in C-SUB.
20.simple-expression→additive-expressionrelopadditive-expression
|additive-expression
21.relop→<=|<|>|>=|==|!=
Structure is made of (i.e. only there are one relational operators for the expression formula without bracket) the relational operator of no combination.Letter
For single expression formula when it does not include relational operator, value is the value of addition expression formula, or if relationship formula evaluates as
Ture, value 1, it is 0 to evaluate as false durations.
22.additive-expression→additive-expressionaddopterm|term
23.addop→+|-
24.term→termmulopfactor|factor
25.mulop→*|/
Addition expression formula and item illustrate the associativity and priority of arithmetic operator.Symbolic indication integer division；I.e. any remainder
All it is truncated.
26.factor→(expression)|var|call|NUM
The factor is the expression formula being trapped among in bracket；Or a variable, find out the value of its variable；Or a function call, it finds out
The return value of function；Or a NUM, value are calculated by scanner.Aray variable must be subscript variable, unless expression formula by
Single ID compositions, and (as follows) is used in function call by parameter of array.
27.call→ID(args)
28.args→arg-list|empty
29.arg-list→arg-list,expression|expression
The composition of function call is an ID (function name), is followed by the parameter to be fenced up with bracket.Parameter be either it is empty or
The expression list divided by comma forms, and indicates the value for the parameter distributed during primary call.Function must before calling
It must state, the number of parameter is necessarily equal to the number of parameter in calling in statement.Array parameter in function declaration must be with one
A expression formula matching, this expression formula is by a group identifier at one aray variable of expression.Finally, above rule is not given
Go out input and output statement.Must include such function in the definition of C-, because different from C, C- does not have independent volume
It translates and the Link tool；Accordingly, it is considered to two predefined functions in global context, as they have been carried out statement：
int input(void){...}
void output(intx){...}
Input functions do not have parameter, and an integer value is returned from standard input device (being typically keyboard).Output functions receive
One argument of type integer, value and a newline print to standard output device (being typically screen) together.
Syntax tree is analyzed
C-SUB use the data structure storage syntactic analysis of abstract syntax tree as a result, as shown in figure 3, being one similar
The syntax tree that this expression formula of 5-4*3 generates.
If the syntax tree of Fig. 3 is derived by the calculating of top-down recursive analysis method, specific derivation
It is as follows：
exp -> exp op exp [exp ->exp op exp]
-> number op exp [exp -> number ]
->number - exp [op -> - ]
->number - exp op exp [exp -> exp op exp]
->number - number op exp[exp -> number]
->number - number * exp[op -> *]
->number - number * number [exp -> number]
The execution of script
The execution of C-SUB programs is to execute calculating using recursive algorithm ergodic abstract syntax tree, and implementation procedure simplifies, and simplifies C-SUB
Processing procedure, memory space is saved, without selecting other script interpretation programs to generate instruction, then again in virtual machine
It is middle to execute these instructions.
Embodiment of above is merely to illustrate the present invention, and not limitation of the present invention, in relation to the common of technical field
Technical staff can also make a variety of changes and modification without departing from the spirit and scope of the present invention, therefore all
Equivalent technical solution also belongs to scope of the invention, and scope of patent protection of the invention should be defined by the claims.
Claims (10)
1. a kind of execution method of explanation type script C-SUB, which is characterized in that include the following steps：
Syntax tree is constructed, the expression formula of mathematical computations is obtained, generates script file；
It initializes the computing system of the expression formula and the initial guess of the expression formula is set；
Execute the script file after the initialization.
2. a kind of execution method of explanation type script C-SUB according to claim 1, it is characterised in that：The grammer
Tree is constructed using precedence of operator analytic approach with recursive algorithm.
3. a kind of execution method of explanation type script C-SUB according to claim 2, it is characterised in that：The grammer
Tree can further construct, minimum operator is determined using the recursive algorithm, and using the minimum operator as root, it is described most
The left side of low operator further constructs respectively with right side.
4. a kind of execution method of explanation type script C-SUB according to claim 1, it is characterised in that：Using postorder
Traversal mode accesses each node of the syntax tree, that is, obtains the expression formula of mathematical computations.
5. according to a kind of any execution methods of explanation type script C-SUB of claim 1-4, it is characterised in that：Make
Use stack as the parking space of provisional parameter.
6. a kind of executive device of explanation type script C-SUB, which is characterized in that including：
Parsing module obtains the expression formula of mathematical computations, generates the script file that can be run for constructing syntax tree；
For initializing expression computing system and the environmental variance initial value of the expression formula is arranged in initialization module；
Execution module, for executing the script file.
7. a kind of executive device of explanation type script C-SUB according to claim 6, it is characterised in that：The grammer
Tree is constructed using precedence of operator analytic approach with recursive algorithm.
8. a kind of executive device of explanation type script C-SUB according to claim 7, it is characterised in that：The parsing
Module includes constructing module, for further being constructed to the syntax tree；Wherein, the constructing module is calculated using the recurrence
Method determines minimum operator, and using the minimum operator as root, in the left side of the minimum operator and right side respectively into one
Step construction.
9. a kind of executive device of explanation type script C-SUB according to claim 6, it is characterised in that：Using postorder
Traversal mode accesses each node of the syntax tree, that is, obtains the expression formula of mathematical computations.
10. according to a kind of any executive devices of explanation type script C-SUB of claim 6-9, it is characterised in that：Make
Use stack as the parking space of provisional parameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810488974.7A CN108664238A (en) | 2018-05-21 | 2018-05-21 | A kind of execution method and device of explanation type script C-SUB |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810488974.7A CN108664238A (en) | 2018-05-21 | 2018-05-21 | A kind of execution method and device of explanation type script C-SUB |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108664238A true CN108664238A (en) | 2018-10-16 |
Family
ID=63776241
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810488974.7A Pending CN108664238A (en) | 2018-05-21 | 2018-05-21 | A kind of execution method and device of explanation type script C-SUB |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108664238A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110018829A (en) * | 2019-04-01 | 2019-07-16 | 北京东方国信科技股份有限公司 | Improve the method and device of PL/SQL language interpreter execution efficiency |
| CN111240772A (en) * | 2020-01-22 | 2020-06-05 | 腾讯科技（深圳）有限公司 | Data processing method and device based on block chain and storage medium |
| CN113947071A (en) * | 2021-10-21 | 2022-01-18 | 北京四方继保工程技术有限公司 | Analysis execution system and method for transformer substation five-prevention file |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060122820A1 (en) * | 2004-12-03 | 2006-06-08 | The Mitre Corporation | Scripting language for domain-specific modification of a simulation model |
| CN106502640A (en) * | 2016-09-19 | 2017-03-15 | 芯海科技（深圳）股份有限公司 | A kind of method for explaining custom script burning |
| CN106970802A (en) * | 2017-04-25 | 2017-07-21 | 北京航天飞行控制中心 | The method and device of integrated programming script in the language-specific of field |
-
2018
- 2018-05-21 CN CN201810488974.7A patent/CN108664238A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060122820A1 (en) * | 2004-12-03 | 2006-06-08 | The Mitre Corporation | Scripting language for domain-specific modification of a simulation model |
| CN106502640A (en) * | 2016-09-19 | 2017-03-15 | 芯海科技（深圳）股份有限公司 | A kind of method for explaining custom script burning |
| CN106970802A (en) * | 2017-04-25 | 2017-07-21 | 北京航天飞行控制中心 | The method and device of integrated programming script in the language-specific of field |
Non-Patent Citations (1)
| Title |
|---|
| 作 者 ：韩太鲁，孙忠林主编: "《编译原理 修订版》", vol. 978, 东营：中国石油大学出版社, pages: 20 - 22 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110018829A (en) * | 2019-04-01 | 2019-07-16 | 北京东方国信科技股份有限公司 | Improve the method and device of PL/SQL language interpreter execution efficiency |
| CN110018829B (en) * | 2019-04-01 | 2022-11-11 | 北京东方国信科技股份有限公司 | Method and device for improving execution efficiency of PL/SQL language interpreter |
| CN111240772A (en) * | 2020-01-22 | 2020-06-05 | 腾讯科技（深圳）有限公司 | Data processing method and device based on block chain and storage medium |
| CN113947071A (en) * | 2021-10-21 | 2022-01-18 | 北京四方继保工程技术有限公司 | Analysis execution system and method for transformer substation five-prevention file |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110187885B (en) | Intermediate code generation method and device for quantum program compiling | |
| Wirth | PL360, a programming language for the 360 computers | |
| US7962904B2 (en) | Dynamic parser | |
| US20070044066A1 (en) | Embedded multi-language programming | |
| CN103077064B (en) | A kind of parsing also executive language method and interpreting means | |
| JPH05508494A (en) | Integrated hierarchical representation of computer programs for software development | |
| Spies et al. | Transfinite Iris: resolving an existential dilemma of step-indexed separation logic | |
| KR950006607B1 (en) | Interface for represeinting efects in a multilanguage optimizing compiler | |
| CN108664238A (en) | A kind of execution method and device of explanation type script C-SUB | |
| US10216501B2 (en) | Generating code in statically typed programming languages for dynamically typed array-based language | |
| CN115809063B (en) | Storage process compiling method, system, electronic equipment and storage medium | |
| CN103235724A (en) | Atomic operation semantic description based integrated translation method for multisource binary codes | |
| Paige | Viewing a program transformation system at work | |
| EP0520708B1 (en) | Method and apparatus for converting high level form abstract syntaxes into an intermediate form | |
| CN112199115A (en) | Cross-Java byte code and source code line association method based on feature similarity matching | |
| CN116541286A (en) | High coverage rate test data generation method based on pile insertion and symbol execution | |
| Champelovier et al. | Reference Manual of the LNT to LOTOS Translator | |
| US11429358B2 (en) | Representing asynchronous state machine in intermediate code | |
| CN1661552B (en) | Process language for microprocessors with finite resources | |
| Chapman | Worst-case timing analysis via finding longest paths in SPARK Ada basic-path graphs | |
| Zhu | Formal specifications of debuggers | |
| Maliavko et al. | The functionally-imperative programming language El and its translator | |
| WO1992003782A1 (en) | Parsing program data streams | |
| KR100246544B1 (en) | Thread creation method for parallel constructs on high speed parallel computer | |
| Maliavko et al. | Functionally Imperative Programming Language El and its Implementation |
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: 20181016 |