Make a program that accepts a Regular Expression in the following format:
(+|-)?d+.d+(E(+|-)?d+.d+)?
The program should take the user expressions from a file and process it for output. Use the transition table to make the FA diagram. However the transition table doesn't fully represent the requirements. You have to use your own fuckin logics to implement the full table.
δ(0,d)=2
δ(0,+)=1
δ(0,-)=1
δ(2,d)=2
δ(4,d)=4
δ(1,d)=2
δ(2,.)=4
δ(0,.)=3
δ(1,.)=3
δ(3,.)=4
There is a bug in this implementation and you have to find it. The final submission should include:
- A Program fulfilling the requirements
- The Algorithm (Not the code, i.e. no syntax)
- Program documentation
- A document citing any difficulties encountered during the development
- $100 check addressed to Uzair Sajid, Chairman UzEE Inc.
The above information is not 100% guaranteed as I also lost my instruction page. I think Shoaib took it.
Posts
