Fig 4 - uploaded by Vadim Zaytsev
Content may be subject to copyright.
Download
View publication
Outputted CFGs for code example 2 and its variation using Raincode's parser

Outputted CFGs for code example 2 and its variation using Raincode's parser

Source publication
Fig. 2: Generated CFGs for code example from Listing 2 and its...
Fig. 3: Generated CFG for the code example from Listing 3
Fig. 4: Outputted CFGs for code example 2 and its variation using...
Fig. 5: Graphs comparing both parsers' performance on various file...
Generating Customised Control Flow Graphs for Legacy Languages with Semi-Parsing
Conference Paper
Full-text available
  • Oct 2022
We propose a tool and underlying technique that uses semi-parsing to extract control flow graphs from legacy source code (written in COBOL). Obtaining such control flow graphs can be useful in the industrial setting of legacy moderni-sation, to quickly demonstrate to code owners that modernisation engineers did not break their business logic. They...
Cite
Download full-text

Context in source publication

Context 1
... contains a lot of synonyms, which the Raincode parser normalises (e.g., characters like < and = in the input appear as GREATER and EQUAL in the tree). The resulting CFGs produced from the Raincode parser outputs for the code in Listing 2 and its variation can be seen on Figure 4. Apart from the small syntactic differences mentioned above, they are equivalent to the CFGs in Figure 2. ...