Register

Parsing

• edited by
470 views
0 votes
0 votes
For a grammar to be LR(k), it should have a PDA? Like a DPDA or just PDA in general?
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
atulcse asked Jan 16, 2022
904 views
made easy test series - parsing - context-free grammar
Consider the following context-free grammar: Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
Consider the following context-free grammar:Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
User Avatar
8 votes
8 votes
2 answers
2
smelly indian asked Sep 6, 2017
1,937 views
Ace Test Series 2018: Compiler Design - Parsing
Consider the following context-free grammar S → SS + | SS*| a It is a)LL(1) b)LR(0) c)Both d)none
Consider the following context-free grammarS → SS + | SS*| aIt isa)LL(1)b)LR(0)c)Bothd)none
User Avatar
2 votes
2 votes
2 answers
4
Sandeep Singh asked Dec 30, 2015
469 views
Is $ a terminal or not ?
Follow(S) comes as {(, ). $ } So, do we count $ ... is also marker to identify that parsing of string has been successfully completed.
Follow(S) comes as {(, ). $ }So, do we count $ as terminal or not.Could anyone please tell me, $ should be considered as terminal or not ? Although I think, I should not...
User Avatar
Link Copied!