Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Gabbar
0
votes
1
Operator Precedence
In Operator precedence parsing, precedence relations are defined, i. for all pair of non-terminals. ii. for all pair of terminals. iii. to delimit the handle. iv. only for certain pair of terminals.
In Operator precedence parsing, precedence relations are defined,i. for all pair of non-terminals.ii. for all pair of terminals.iii. to delimit the handle.iv. only for ce...
2.1k
views
answered
Oct 15, 2017
Compiler Design
compiler-design
operator-grammar
+
–
0
votes
2
time complexity
what the time complexity for T(n)=5T(n/2)+n^2 a. n b.n^2
what the time complexity forT(n)=5T(n/2)+n^2a. nb.n^2
431
views
answered
Jul 22, 2017
Algorithms
time-complexity
recurrence-relation
+
–
0
votes
3
Doubt
Is it possible to prove number of b's=2k+1 and any number of a's is regular using Myhill–Nerode theorem ?
Is it possible to prove number of b's=2k+1 and any number of a's is regular using Myhill–Nerode theorem ?
258
views
answered
May 6, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
4
Peter Linz Exercise 7.3
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ? #4 : Is the language L={anbn : n>=1} U {a} deterministic ? #7 Is the following regular language deterministic? L= { anbmck : n=m or m=k } #8 Is the L = {anbm : n ... ended and WR has started. #11- No Idea about it. Please someone verify and tell me is my way of analysis and the analysis is correct or not?
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ?#4 : Is the language L={anbn : n>=1} U {a} deterministic ?#7 Is the following regular language deterministic?...
3.3k
views
answered
Mar 31, 2017
Theory of Computation
theory-of-computation
deterministic-context-free-grammars
context-free-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register