in reply to Re: Another for those who love the Regular Expression questions...
in thread Another for those who love the Regular Expression questions...

I am a seeker of Perl wisdom and have just joined you as a monk. I was faced with a challenging question where I need heros to chip in. The question is as follows: Write a Perl program which simulates the operation of finite automata. The finite automata are represented using transition tables. They are restricted to a maximum of 10 states labelled 0-9, with start state 0. Their alphabets are restricted to a maximum of 26 lower case symbols a-z. The alphabet and transition tables of the finite automaton are specified in blank-seperated fields. The first line specifies the alphabet of the finite automaton, representing end-of-strings as #. The next line represent the rows of the transition table in order. The error condition is represented as ! and the accept condition by *. The line specifying the last row of the transition table is followed by a blank line, followed by zero or more lines representing the input strings, one string per line. The program must read the alphabet, the transition table and the input strings and for each string it must print, on one line, “Accept” or “reject”, followed by the input string. Input strings containing illegal symbols not in the machine’s alphabet must be rejected. The report on the final string must be followed by one blank line. The following lines for example represent a 3-state finite automaton which accepts strings over the alphabet {a,b} which contain double-b, followed by strings to be analysed: a b # 0 1 ! 0 2 ! 1 2 * <blank line> aababa babbaab abaaabbaa bbx <blank line> Given this input your program must output the following results: Reject aababa Accept babbaab Accept abaaabbaa Reject bbx <blank line> The representations of zero or more finite automata and their strings are given in a file. The program must write output to a file. I would appreciate if you help me out. My e-mail adress is:

Replies are listed 'Best First'.
RE (tilly) 2: Sorry
by tilly (Archbishop) on Oct 09, 2000 at 21:56 UTC
    Voted -- because this really looks like homework. My apologies if I am wrong, but I don't think I am.

    If I knew your personally I would not only vote --, I would try to figure out which class I thought it was for and would tell your professor. Which, depending on your school's rules for academic integrity, could result in failure or expulsion.

    If I did not miss my guess, then please review your school's honor code before asking for others to do your homework.

      This is a few years old but I just came across it and I have to say: damn straight.