flowchart-editor/Pseudo_NewCodeAlgorithm.java at master · rafgugi/flowchart-editor · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/* Begin code flowchartElement, send father, his son, and new code */
father = terminator start;
son = father.getFlow().getSon();
newCode = new NodeCode(); // (0,0)
set nodeCode of father with newCode
stackOfJudgment = new Stack<>();
doWhileStack = new Stack<>();
codeAlgorithm(father, son, father.getNodeCode().createSibling());

function codeAlgorithm(FlowChartElement father, FlowChartElement currElem, NodeCode currCode)
  if (currElem is Terminator)
    return; // exit point of recursion

  if (currElem.getDoWhileNode() != doWhileStack.peek)
    reset traversed of currElem // masih butuh recode

  if (currElem is Process)
    if (currElem isntTraversed)
      traverse currElem
      set nodeCode of currElem with currCode
      son = currElem.getFlow().getSon();

      codeOfSon = currCode.createSibling();
      codeAlgorithm(currElem, son, codeOfSon);

      if (father is Judgment && father type not defined or DoWhile)
        set type of father with DoWhile
        thisCode = node code of currElem
        set nodeCode of father with thisCode
        thisCode.clearChildren();

        doWhileStack.push(father);
        father.setDoWhileNode(doWhileStack);
        childCode = create child of thisCode;
        codeAlgorithm(father, currElem, childCode);
        doWhileStack.pop;

  if (currElem is Judgment)
    if (currElem isntTraversed)
      traverse currElem
      set nodeCode of currElem with currCode

      if (currElem.getDirectConvergence() == null)
        stackOfJudgment.push(currElem);

      convergenceson = null
      for each (sons of currElem as son)
        if (son is Convergence)
          convergenceSon = son;
          continue;

        sonCode = create child of currCode;
        codeAlgorithm(currElem, son, sonCode);

      if (convergenceson != null)
        codeAlgorithm(currElem, convergenceson, null);

      if (currElem.getType == null)
        set type of father with Selection

      convergence = directConvergence of currElem
      sonCode = create sibling from node code of convergence
      sonNode = son of convergence
      codeAlgorithm(convergence, sonNode, sonCode);

    else  // been traversed.
      if (currElem.getType == null)
        set type of father with While
      else  // and been recognized
        if (father is Judgment && father.getType == null)
          set type of father with DoWhile
          thisCode = node code of currElem
          set nodeCode of father with thisCode
          thisCode.clearChildren();

          doWhileStack.push(father);
          father.setDoWhileNode(doWhileStack);
          childCode = create child of thisCode;
          codeAlgorithm(father, currElem, childCode);
          doWhileStack.pop;

  if (currElem is Convergence)
    if (currElem isntTraversed)
      traverse currElem

      if (currElem doesnt have directJudgment)
        judgment = stackOfJudgment.pop;
        set direct judgment of currElem with judgment
        set direct convergence of judgment with currElem
    set nodeCode of currElem with node code of currElem directJudgment