CN103365635A - Method for converting control processes in flow chart into program control statements - Google Patents
Method for converting control processes in flow chart into program control statements Download PDFInfo
- Publication number
- CN103365635A CN103365635A CN2012100864368A CN201210086436A CN103365635A CN 103365635 A CN103365635 A CN 103365635A CN 2012100864368 A CN2012100864368 A CN 2012100864368A CN 201210086436 A CN201210086436 A CN 201210086436A CN 103365635 A CN103365635 A CN 103365635A
- Authority
- CN
- China
- Prior art keywords
- flow diagram
- stream
- process flow
- node
- flow chart
- 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
Abstract
The invention discloses a method for converting control processes in flow chart into program control statements and aims to convert judge control processes and circulation control processes in the flow chart into judge code blocks and circulation code blocks of special markup language according to features of a stream formed by connection lines in the flow chart and according to needs. The stream is a logic stream formed by one or more nodes connected by the connection lines in the flow chart, and the stream is divided into multiple streams by judge nodes. The judge code blocks are if judge processing code blocks and the like used in program codes. The circulation code blocks are while circulation code blocks and the like used in program codes. By the method, the process conversion is easy to implement, nodes can be shared, the corresponding flow chart is clear and easy to maintain, and the like.
Description
Technical field
The invention relates to and a kind of control procedure in the process flow diagram is converted to the method for program control statement, the stream that particularly the judgement control procedure in the process flow diagram and cycle control process is formed according to line is converted to judgement code block and the loop code piece of specific program language as required.
Background technology
The patent of invention that the applicant has applied for a kind of system and method for graphical making software on March 12nd, 2012, application number is 201210062317.9, this patent is made the system and method for software systems for the non-computer professional provides an Analysis of Nested Design, the user can be by graphical interfaces the mode design object, then by the mode of the drawing process flow diagram logic of designing program.Function for the logic of designing program by the mode of drawing process flow diagram, need conversion equipment the control procedure of process flow diagram to be converted to the programmed control code of specific program language, and then be converted to object code, the invention provides a kind of method that control procedure in the process flow diagram is converted to program control statement.
Summary of the invention
The object of the invention is the stream that the judgement control procedure in the process flow diagram and cycle control process form according to line is converted to as required judgement code block and the loop code piece of specific program language, described stream is the logic flow that is connected to form through line by one or more nodes in the process flow diagram, be divided into a plurality of streams by decision node therebetween, described judgement code is that judging such as if of using in the program code processed code block, and described loop code piece is the loop code piece such as the while circulation that uses in the program code.
Determine that according to the decision node information in the process flow diagram one judges the beginning of code block, determine the end of this judgement code block according to the joint information of this decision node stream out.If contain identical flow identification information in two streams that cross in the process flow diagram, then determine the beginning of loop code piece by the nodal information that crosses, determine the end of loop code piece according to the decision node information of corresponding stream in the process flow diagram.
The transfer process that realizes by above method has easy realization, and node such as can share at advantage, the simultaneously corresponding clear easy care of process flow diagram.
Description of drawings
Fig. 1 is control procedure in the process flow diagram of the present invention and the corresponding relation of program control statement;
Embodiment
Below realize preferred example of the present invention by example explanation.
Please refer to Fig. 1, left area 1 is a process flow diagram among Fig. 1, and zone, the right 2 is corresponding with it programmed control code.Comprise traffic identifier and expression formula information in each node in the zone 1, wherein the part of " " symbol front end is the traffic identifier symbol, and " " symbol rear end is expression formula, can be with the place that certain can be read and write that is kept at of traffic identifier recessiveness in the practice process; Such as " 1@a=x in the start node 10; ", namely the traffic identifier at this node place is 1, expression formula is a=x; And in the node 19 " 1.1+1.2@c12c=z ", show that then two affluent-dividing 1.1.1,1.1.2 of traffic identifier 1.1 and the stream of 1.2 correspondences all pass through this node, and traffic identifier 1.1.1 shows that it connects from traffic identifier 1.1, and traffic identifier 1.1 connects from traffic identifier 1, by that analogy.
Please refer to Fig. 1, the corresponding program code that the right edge regions 2 of Fig. 1 converts to for regional 1 process flow diagram.Wherein every row ": " symbol the first section is the line identifier in order to explanation, and ": " symbol back part is corresponding program code.
In the process of making process flow diagram, the traffic identifier of node 10 and 11 is defined as 1, and decision node 12 has three affluent-dividings, respectively its traffic identifier is defined as 1.1,1.2,1.3, decision node 14 has two affluent-dividings, respectively its traffic identifier is defined as 1.1.1 and 1.1.2; For node 19,1.1.1,1.1.2 and 1.2 cross by stream, and wherein flowing 1.1.1 and 1.1.2 is two affluent-dividings of node 14, and namely all affluent-dividings of node 14 all cross, and then its corresponding stream is 1.1, so node 19 contains the information of 1.1 and 1.2 two streams; For node 110, crossed by three affluent-dividings 1.1,1.2 and 1.3 that flow 1, it is equivalent to stream 1.
When process flow diagram was converted to the programmed control code, node 10 directly was converted to the code of code line 01 in the zone 2; Node 11 has two streams to cross, and contains simultaneously stream 1, then is converted to the beginning of loop code piece, and cycling condition finds the condition of its initial decision node 111 to generate according to stream information, code behavior 02, and its expression formula generated to code line 03; Rule of judgment generating code capable 04 according to the tributary 1.1 of decision node; Node 13 generating codes capable 05; In the decision node 14＞0 judgement generating code capable 06; Node 16 generating codes capable 07; Contain stream 1.1 in the node 19, show that this stream finishes generating code capable 08; In the decision node 14＜=0 judgement generating code capable 09; Node 15 converts code line 10 to; Though node 18 contains two streams, only contain a tributary 1.1.2 of stream 1.1, so generating code capable 11; Contain stream 1.1 in the node 19, indicate this tributary end, generating code capable 12 and code line 13; Contain stream 1 in the node 110, three shuntings of sign node 12 all cross, indicate that stream 1.1 finishes generating code capable 14; Next process stream 1.2, generating code capable 15; Node 17 generating codes capable 16; Though node 18 has stream to cross, do not contain the phase homogeneous turbulence, generating code capable 17; Same node 19 generating codes capable 18; Three shuntings of sign node 12 all cross, indicate that stream 1.1 finishes generating code capable 19; Next process stream 1.3, generating code capable 20; Node 112 is decision node, generating code capable 21; Node 113 and 114 is generating code capable 22 and 23 successively; Contain stream 1 in the node 110, three shuntings of sign node 12 all cross, indicate that stream 1.3 finishes generating code capable 24 and 25; So far three of node 12 shuntings are disposed, according to node 110 generating codes capable 26; Node 111 is the decision node of circulation, generating code; Node 112 does not have expression formula, does not process.
The transfer process that realizes by above method has easy realization, and node such as can share at advantage, the simultaneously corresponding clear easy care of process flow diagram.
The above embodiment only is the better embodiment of the present invention; and unrestricted claim of the present invention; the structural change of the modification that any utilization instructions related content of the present invention is done and equivalence and enforcement and the corresponding inspection method of carrying out all should be included within the scope of patent protection of the present invention.
Claims (4)
1. method that the control procedure in the process flow diagram is converted to program control statement, its process is, the feature of the stream that forms according to the line in the process flow diagram is converted to the judgement control procedure in the process flow diagram and cycle control process judgement code block and the loop code piece of program language as required, it is characterized in that, use the identification information of stream in the described transfer process.
2. a kind of method that control procedure in the process flow diagram is converted to program control statement as claimed in claim 1, it is characterized in that, determine that according to the decision node information in the process flow diagram one judges the beginning of code block, determine the end of this judgement code block according to the feature that crosses of decision node stream out.
3. a kind of method that control procedure in the process flow diagram is converted to program control statement as claimed in claim 1, it is characterized in that, if contain identical flow identification information in two streams that cross in the process flow diagram, then determine the beginning of loop code piece according to the feature of this node that crosses, determine the end of loop code piece according to the decision node feature of corresponding stream in the process flow diagram.
4. as claimed in claim 1ly a kind of control procedure in the process flow diagram is converted to the method for program control statement, it is characterized in that containing in the identification information of described stream directly or indirectly to provide the function of distinguishing a plurality of streams.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100864368A CN103365635A (en) | 2012-03-29 | 2012-03-29 | Method for converting control processes in flow chart into program control statements |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100864368A CN103365635A (en) | 2012-03-29 | 2012-03-29 | Method for converting control processes in flow chart into program control statements |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103365635A true CN103365635A (en) | 2013-10-23 |
Family
ID=49367078
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100864368A Pending CN103365635A (en) | 2012-03-29 | 2012-03-29 | Method for converting control processes in flow chart into program control statements |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103365635A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010044811A1 (en) * | 2000-03-09 | 2001-11-22 | Electronic Data Systems Corporation | Method and system for reporting XML data based on precomputed context and a document object model |
| US20030177471A1 (en) * | 2002-03-12 | 2003-09-18 | Yen-Chang Chiu | System and method for graphically developing a program |
| CN1459719A (en) * | 2002-05-17 | 2003-12-03 | 义隆电子股份有限公司 | System of pattern development program and method |
| CN1967574A (en) * | 2005-11-17 | 2007-05-23 | 深圳市东进通讯技术股份有限公司 | Method and system to realize generating of integrated communications platform process |
| CN101776999A (en) * | 2010-01-28 | 2010-07-14 | 苏州工业园区进一科技有限公司 | Platform for developing and implementing software system |
-
2012
- 2012-03-29 CN CN2012100864368A patent/CN103365635A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010044811A1 (en) * | 2000-03-09 | 2001-11-22 | Electronic Data Systems Corporation | Method and system for reporting XML data based on precomputed context and a document object model |
| US20030177471A1 (en) * | 2002-03-12 | 2003-09-18 | Yen-Chang Chiu | System and method for graphically developing a program |
| CN1459719A (en) * | 2002-05-17 | 2003-12-03 | 义隆电子股份有限公司 | System of pattern development program and method |
| CN1967574A (en) * | 2005-11-17 | 2007-05-23 | 深圳市东进通讯技术股份有限公司 | Method and system to realize generating of integrated communications platform process |
| CN101776999A (en) * | 2010-01-28 | 2010-07-14 | 苏州工业园区进一科技有限公司 | Platform for developing and implementing software system |
Non-Patent Citations (1)
| Title |
|---|
| 钟志超: "流程图与类C语言实时转换方法", 《东南大学学报（自然科学版）》, vol. 39, no. 3, 20 May 2009 (2009-05-20), pages 502 - 507 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101841542B (en) | Method for realizing PROFIBUS master station communication protocol based on FPGA (Field Programmable Gate Array) technology | |
| CN1327340C (en) | Processor and compiler | |
| CN104933008B (en) | Reconfigurable system and reconfigurable array structure and its application | |
| CN104899150B (en) | Automated testing method and system and automation platform based on object-oriented | |
| CN107423054A (en) | Self-defined graphical algorithm configuration devices, systems, and methods based on FPGA | |
| CN105045743B (en) | A kind of multi protocol conversion method for possessing priority scheduling | |
| CN105072130A (en) | Method for automatically generating code of ASN.1 decoder | |
| CN102981827A (en) | Display interface data treatment method and platform based on middle piece | |
| CN105812365B (en) | A kind of programmable restructural Frame Handler | |
| CN103365636A (en) | Method for converting control processes in flow chart into program control statements | |
| CN104462687A (en) | Repairable GO algorithm based on dynamic Bayesian network | |
| CN103365635A (en) | Method for converting control processes in flow chart into program control statements | |
| CN104360906A (en) | High-level comprehensive scheduling method based on difference constraint system and iterative model | |
| CN108574594A (en) | A kind of method and system of network service transmission | |
| CN202120300U (en) | Counter device composed of ARM and FPGA | |
| CN103365634A (en) | Method for transferring controlling processes into program control statements in flow chart | |
| CN207473606U (en) | The communicating circuit of disparate step artificial neural network chip based on click controllers | |
| CN103780427A (en) | Method and system for generating multi-protocol fault management message based on FPGA | |
| CN105528319A (en) | FPGA-based accelerator card and acceleration method thereof | |
| CN106855846A (en) | A kind of PCIE signal extension system and method based on PCIE Switch | |
| CN110161893A (en) | The communication means and storage medium of slave device, control system, response data | |
| CN103810142B (en) | Reconfigurable system and construction method thereof | |
| CN102567281B (en) | Reconfigurable scheduling operator array structure, integrated circuit (IC) array structure and control module | |
| CN205375150U (en) | Realize PLC controlling means at FPGA platform | |
| CN104158903A (en) | Method and system of encoding OAM (Operation Administration and Maintenance) protocol stack |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: SUZHOU JINGYIHUI INFORMATION TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: SIP JINYI TECH CO., LTD. Effective date: 20140901 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20140901 Address after: 215000 Jiangsu Province, Suzhou City Industrial Park, building 69 room 905 guests Applicant after: Suzhou Jingyihui Information Technology Co., Ltd. Address before: 215000 Jiangsu Province, Suzhou City Industrial Park, building 69 room 905 guests Applicant before: Suzhou Industrial Park Jinyi Technology Co., Ltd. |
|
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20131023 |