ALGORITHM to simulate any Deterministic Pushdown Automata (DPDA)

Asked Apr 05 '13 at 06:35

Active Apr 05 '13 at 06:35

Viewed 956 times

how to write a program that can model any Deterministic Pushdown Automata (DPDA) the user should enter number of states, transition functions, input symbols the program should model the pda requested for and test for the acceptance or rejection of random strings entered by the user

this is what i have done so far in c++ -i have collected the number of states, input symbols, and the input symbols -i am on the transition function but cant seem to go further because i just cannot conceptualize modelling the DPDA

asked Apr 05 '13 at 06:35

Tom Phil

Your question is very specific but it might help to show a little source code. – Roger Rowland Apr 05 '13 at 06:54
thanks...got a great inspiration from GOD yday...on it...sure 2 keep u posted – Tom Phil Apr 06 '13 at 13:18
aii...now theres something...how can i empty a stack...pls i need a swift response – Tom Phil Apr 06 '13 at 13:53
Assign another empty stack to it ... – Roger Rowland Apr 06 '13 at 14:06
hmmn...thanks...do i need to initialize the empty stack and how...i am kind of new with stacks – Tom Phil Apr 06 '13 at 18:43
Something like pStack = std::stack(); – Roger Rowland Apr 06 '13 at 19:01
what can make a an else block to run after its if block has ran – Tom Phil Apr 06 '13 at 19:26
thanks but do u need to initialize the empty stack...i mean how do u initialize a stack to empty...m kind of new with stack – Tom Phil Apr 07 '13 at 03:51
That's what I showed in the previous comment. Maybe you need to ask a new question for specific points. – Roger Rowland Apr 07 '13 at 03:55

ALGORITHM to simulate any Deterministic Pushdown Automata (DPDA)

0 Answers0