Awesome q2a theme
0 votes
31 views

Consider the following grammer: 

$S → A$

$A→ BC|DBC$

$B→ Bb| ϵ $

$C→ c|ϵ$

$D→ a|d$

A LL(1) parsing table is constructed for the grammar as :

Terminals$→ $   a                 b                   c                      d                 $

S                                          
A          
B          
C       $C→ c $    
D    $D→ a $      $D→ d $  

Let $ ‘x’,’y’,'z’ $ and $ ‘u’ $ represents the number of entries in row of Non-terminal $ ‘S’,’A’,’B’ $ and $ ‘C’ $ respectively. The Value of  $ x+y+z+u $ is $ ___________$.

closed with the note: duplicate question
in Compiler Design by (64 points)
closed by | 31 views
0
5+5+3+2=15??
0

@srestha

Mam, is it even LL(1) because of $B\rightarrow Bb|\epsilon$ this.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jul 2020
  1. Shaik Masthan

    39 Points

  2. pritishc

    10 Points

  3. Charuji24

    9 Points

  4. hiteshpujari

    9 Points

  5. srestha

    9 Points

  6. fazin

    7 Points

  7. divi2719

    7 Points

  8. sthakur369

    6 Points

  9. Richa Agrawal

    6 Points

  10. gaurav2697

    6 Points

7,577 questions
1,785 answers
10,885 comments
90,507 users