Register

Theory of compiler

167 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · GO Classes GATE DA |...Next → · DFA
← Previous in category · UGC NET CSE | June 2...Next in category → · CD - ERROR
Position:
Show:

Related questions

0 0 votes
0 0 answers
468
468 views
Ebrahim asked Oct 17, 2024
468 views
Theory of compiler Ullman (Compiler Design) Edition 2
Q4. Check the ambiguity for the string id[id]in the given grammar:E → E+T | TT → id | id[ ] | id[X]X → E , E | E Please answer like example in this page link https://ww...
0 0 votes
1 1 answer
1.1k
1.1k views
Ebrahim asked Oct 17, 2024
1,079 views
Theory of compiler Ullman (Compiler Design) Edition 2
Q1. a) Convert the given NFA to DFA. (Show the steps)    b) Write the regular expression for “ String starts with 1 and has an even length.”        
0 0 votes
1 1 answer
316
316 views
Ebrahim asked Oct 17, 2024
316 views
Theory of compiler Ullman (Compiler Design) Edition 2
5. Convert the following:a) Given FA to RE  b) Given RE to DFA : (a|b)*(abb|a+ b)       
0 0 votes
2 2 answers
389
389 views
Ebrahim asked Oct 13, 2025
389 views
Theory of compiler Ullman (Compiler Design) Edition 2 Thory of computation
Please please please help me Answer thisQ1. Given RE to DFA: (0+1)*10*10*Q2. Write the regular expression for: “All strings of {a,b}containing atleast two b’s.”