Story Category: Vijeo Citect
VOTEFinite 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
12 years ago in Delphi, delphi 2010, Delphi XE, P-Zaggy, Regular Expressions, TCanvas, Vijeo Citect, VLO Framework
0
Finite Automata with Thundax P-Zaggy part II
Jordi Corbilla
Going on with the further enhancement of P-Zaggy (part I) to use its graph creation capability to run and simulate DFA, I have released a new version (v1.2.0 build 180) which allows you to check… … Read more
12 years ago in Delphi, delphi 2010, Delphi XE, P-Zaggy, Regular Expressions, TCanvas, Vijeo Citect, VLO Framework
0
Finite Automata with Thundax P-Zaggy part I
Jordi Corbilla
I have moved forward the development of Thundax P-Zaggy with the addition of a Finite Automata builder and simulator. “A deterministic finite automaton (DFA) also known as deterministic finite state machine is a finite state machine… … Read more
12 years ago in Delphi, delphi 2010, Delphi XE, P-Zaggy, Regular Expressions, TCanvas, Vijeo Citect, VLO Framework
0