99 views

Please log in or register to answer this question.

Related questions

774
views
0 answers
0 votes
o asked Jan 2, 2022
774 views
I understand all these following separately :1) DCFG is always unambiguous2) Regular grammar is a subset of DCFG3) Regular grammar can be ambiguousBut can't understand how any DCFG is unambiguous if its subset can be ambiguous
973
views
3 answers
0 votes
Dheeraj Pant asked Nov 8, 2018
973 views
S->Aa | Bc A->a B->a1. Is the above grammer left factored ?? If not ,then do left factoring on it ??2. Is above grammer deterministic ?? 3. Is every left factored grammer deterministic ??
412
views
0 answers
0 votes
Tridhara Chakrabarti asked Dec 14, 2017
412 views
Self doubt--Hello i am preparing for gate on my own reading textbooks. There is a very detailed garbage collection part in runtime environments part in Aho ... read from there.. Any past gate rankers and fellow gate aspirants kindly reply.
240
views
1 answers
1 votes
halfcodeblood asked May 26
240 views
How to approach this type of questions?