Re: Reachability of DFA part

W dniu piątek, 20 grudnia 2019 17:41:04 UTC+1 użytkownik Kaz Kylheku
napisał:
> In the NFA automaton, every time the prefix of the input given so far
> ends in ba, the machine will be in an acceptance state corresponding
> to that trailing ba.


Machine finally accept all strings begin from "ab" but "ba" will unused.
This is similar to definition of comment: in Pascal. comment begin at { and
end of }, careless definition is {*} which mark as comment to rest of file.


Good definition would be {[^}]*}
Complexity of problem increases when comment ends with string len >1, for
example C: */ or Pascal *)
if we renaming : /->a *->b other->c
then bad definition will ab(a|b|b)*ba and good definition is complicated:
ab(b|(a|c)*b*)*a (if I not make mistake)


Commments should maybe be defined in other way, especially comments can be
nested in Object Pascal. Comment nesting can using stack or simply counter. I
see, in Pascal is using counter. Difference: Pascal has two types of multiline
comments { } and (* *)


If we use stack, closing comment type must be equal last open comment type,
for counter - only count comments of type first opening, example
{ { (* } *) }

Return to the comp.compilers page.
Search the comp.compilers archives again.