From: notifies s. of c. c. <per...@li...> - 2006-09-26 23:27:10
|
Revision: 73 http://svn.sourceforge.net/perl-flat/?rev=73&view=rev Author: estrabd Date: 2006-09-26 16:27:06 -0700 (Tue, 26 Sep 2006) Log Message: ----------- .. Modified Paths: -------------- trunk/perl-flat/dev-scripts/regex-to-nfa.pl trunk/perl-flat/lib/FLAT/PFA.pm Modified: trunk/perl-flat/dev-scripts/regex-to-nfa.pl =================================================================== --- trunk/perl-flat/dev-scripts/regex-to-nfa.pl 2006-09-26 23:17:12 UTC (rev 72) +++ trunk/perl-flat/dev-scripts/regex-to-nfa.pl 2006-09-26 23:27:06 UTC (rev 73) @@ -10,7 +10,7 @@ my $nfa = FLAT::Regex->new($regex)->as_nfa; my $dot = $nfa->as_graphviz; -my $summary = $nfa->as_summary; +zmy $summary = $nfa->as_summary; print "$summary\n"; Modified: trunk/perl-flat/lib/FLAT/PFA.pm =================================================================== --- trunk/perl-flat/lib/FLAT/PFA.pm 2006-09-26 23:17:12 UTC (rev 72) +++ trunk/perl-flat/lib/FLAT/PFA.pm 2006-09-26 23:27:06 UTC (rev 73) @@ -165,8 +165,6 @@ $self; } -1; - # stretching my legs after a few months being gone ... see if the legacy conversion # can be modified to work @@ -174,7 +172,8 @@ # PSUEDO CODE # my @Dstates = get_starting(); # while (@Dstates) -# { my @T = @{pop (@Dstates)}; !!remember that states are made up of 1 or more nodes +# { my @T = @{pop (@Dstates)}; +# #remember that states are made up of 1 or more nodes # my $current = $self->serialize_name(@T) # add $current (or @T) to @DONE stack # foreach my $symbol ($self->alphabet) @@ -207,6 +206,8 @@ return $result; } +1; + __END__ =head1 NAME This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |