Register

Ace Test Series: Compiler - Parser Conflicts

• edited by
1,036 views
1 votes
1 votes

Consider the following CFG.

S → aSa|bSb|a|b

Number of conflicts in LR(0) State Diagram?

  1. 2
  2. 8
  3. 10
  4. 4
• edited by
User Avatar

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
1 answer
1
Na462 asked Jan 26, 2019
399 views
Ace Test Series: Compilers - Parser
User Avatar
1 votes
1 votes
1 answer
2
baghel263 asked Jan 17, 2019
1,021 views
conflicts in parser
does augmented production causes conflicts
does augmented production causes conflicts
User Avatar
0 votes
0 votes
1 answer
3
Aibi asked Sep 22, 2017
737 views
Ace Test Series: Compiler Design - Parsing
S -> Aa A -> Ab A -> c Which of the following item is present in LR(1) item with S' -> .S, $\$ ? A) A -> .Ab, $\$ B) A -> .c, $\$ C) A -> .Ab, a/b D) None
S - AaA - AbA - cWhich of the following item is present in LR(1) item with S' - .S, $\$$ ?A) A - .Ab, $\$$B) A - .c, $\$$C) A - .Ab, a/bD) None
User Avatar
8 votes
8 votes
2 answers
4
smelly indian asked Sep 6, 2017
1,940 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
Link Copied!