Jordi Corbilla
Moving ahead with FA, now we can generate the right-linear grammar that corresponds to the finite automata generated. The system is pretty simple and basically what the algorithm does is to go recursively through every… … Read more
13 years ago in Delphi, delphi 2010, Delphi XE, P-Zaggy, Regular Expressions, TCanvas, Vijeo Citect, VLO Framework
0
Finite automata to Regular Grammar with Thundax P-Zaggy
Jordi Corbilla
Moving ahead with FA, now we can generate the right-linear grammar that corresponds to the finite automata generated. The system is pretty simple and basically what the algorithm does is to go recursively through every… … Read more
13 years ago in Delphi, delphi 2010, Delphi XE, P-Zaggy, Regular Expressions, TCanvas, Vijeo Citect, VLO Framework
0