0 votes
51 views
in Computational Tools by (user.guest)

1 Answer

0 votes
by (user.guest)
 
Best answer

DPDAs are deterministic, whereas NPDAs are non-deterministic. With some abuse of notation, we can say that NPDAs are a generalization of DPDAs: every DPDA can be simulated by an NPDA, but the converse doesn't hold (there are context-free languages which cannot be accepted by a DPDA).

We can simulate DPDAs much more easily with our deterministic computers (real hardware is always deterministic). In fact, simulating general DPDAs is not fast enough for most purposes, and so when parsing code we usually use LALR grammars which are weaker than DPDAs.


Related questions

0 votes
0 answers 113 views
0 votes
1 answer 146 views
0 votes
1 answer 175 views
+1 vote
1 answer 4.5k views
+1 vote
1 answer 642 views
+1 vote
1 answer 332 views
0 votes
1 answer 67 views
+1 vote
1 answer 55 views
+1 vote
1 answer 99 views
+1 vote
1 answer 104 views
+1 vote
1 answer 84 views
+1 vote
1 answer 158 views
0 votes
1 answer 96 views
+1 vote
1 answer 170 views
0 votes
1 answer 294 views
+1 vote
1 answer 191 views
+1 vote
1 answer 366 views
+1 vote
1 answer 218 views
+1 vote
1 answer 177 views
+2 votes
1 answer 124 views
+1 vote
1 answer 153 views
+2 votes
1 answer 187 views
+2 votes
1 answer 155 views
+1 vote
1 answer 354 views
+1 vote
1 answer 522 views
+1 vote
1 answer 1.0k views
+1 vote
1 answer 467 views
+2 votes
1 answer 1.3k views
+3 votes
1 answer 403 views
+1 vote
1 answer 564 views
Welcome to CPENTalk.com
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

...