Process of automatically translating a high level programming language into an extended activity diagram

A process of automatically translating a high level programming language into an activity diagram, which adds a translation rule in a compiler to accordingly translate source codes coded by the high level language into a corresponding activity diagram, the process comprising the steps:

• (A) reading a source code;
• (B) translating the source code read in step (A) into a corresponding subgraph when the source code is not a statement instruction, and executing step (A);
• (C) translating a statement into a corresponding subgraph when the source code read in step (A) is the statement instruction and the statement is in front of a condition expression in the statement instruction;
• (D) generating a select node;
• (E) generating left and right curve points respectively linked to the select node;
• (F) translating a statement, which is not in front of the condition expression in the statement instruction, into a corresponding subgraph;
• (G) generating a merge node to merge the subgraphs;
• (H) linking up the subgraph generated in step (F) with the right curve point;
• (I) linking up the subgraph generated in step (F) with the merge node;
• and
• (J) determining if an instruction is to be translated into a corresponding subgraph;
• if yes, executing step (A);
• and if not, completing and outputting the corresponding activity diagram.