Register

Recent questions tagged first-and-follow

0 votes
0 answers
1
FIRST $ FOLLOW
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
0 votes
1 answer
2
FIRST & FOLLOR
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
5 votes
1 answer
3
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 2
Consider the following grammar- ... $\text{Follow(T)}$ are same. $\operatorname{First}(\mathrm{A})$ and $\operatorname{First}(\mathrm{T})$ are same.
Consider the following grammar-$$\begin{aligned}& S \rightarrow b T \\& T \rightarrow A b \mid B a \\& A \rightarrow a S \mid C B \\& B \rightarrow b D \\& C \rightarrow ...
User Avatar
1 votes
3 answers
4
Made Easy Test Series - Compiler Design
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
User Avatar
0 votes
1 answer
5
first follow self doubt
Does Follow and First operation always apply on non left recursive grammar?
Does Follow and First operation always apply on non left recursive grammar?
User Avatar
2 votes
1 answer
6
Compiler Design
Confusion in follow of A,Please clarify.
Confusion in follow of A,Please clarify.
User Avatar
0 votes
3 answers
7
Remove left recusrion and find out first and follow
Compute the FIRST and FOLLOW for the postfix grammar after removing the left recursion: $ S → S S+/ S S* /a$
Compute the FIRST and FOLLOW for the postfix grammar after removing the left recursion:$ S → S S+/ S S* /a$
User Avatar
0 votes
1 answer
8
Compute FIRST and FOLLOW sets
Compute FIRST and FOLLOW sets: S→ aAC | bB A→ Abc| Abd | e B→ f | g C→ h | i
Compute FIRST and FOLLOW sets:S→ aAC | bBA→ Abc| Abd | eB→ f | gC→ h | i
User Avatar
0 votes
1 answer
13
Follow Set Self Doubt
X->aABe B->c | d A->a What will be the follow of A here? {c, d, $} or {c, d, e, dollar}
X->aABeB->c | dA->aWhat will be the follow of A here?{c, d, $} or {c, d, e, dollar}
User Avatar
1 votes
0 answers
15
First set and follow set self-doubt
why do first sets can have epsilon symbol but follow sets don’t? P.S: I’ve a silly doubt :P
why do first sets can have epsilon symbol but follow sets don’t?P.S: I’ve a silly doubt :P
User Avatar
1 votes
1 answer
16
MadeEasy Test Series: Compiler Design - Grammar
Consider the following grammar G shown Below : S → abS | ScS | d | c The number of terminals in follow set of non-terminal S is ___________________ Is “$” symbol considered terminal?
Consider the following grammar G shown Below :S → abS | ScS | d | cThe number of terminals in follow set of non-terminal S is ___________________ Is “$” symbol cons...
User Avatar
1 votes
1 answer
17
compiler design. Why SLR(1) even if follow are different?
Consider the following grammar S --> Ka|bKc|dc|bda K ---> d The grammar is not LALR(1) SLR(1) LR(1) none of the above
Consider the following grammarS Ka|bKc|dc|bdaK - dThe grammar is notLALR(1)SLR(1)LR(1)none of the above
User Avatar
0 votes
2 answers
18
ME test series
Consider the following CFG, with S as start symbol: S -> aA l CB A -> BaA I e B-> bB l Abc l e C -> B (HERE ‘e’ IS EPSILON OR NULL PRODUCTION) FIRST(B)? FOLLOW(C)?
Consider the following CFG, with S as start symbol:S - aA l CBA - BaA I eB- bB l Abc l eC - B (HERE ‘e’ IS EPSILON OR NULL PRODUCTION)FIRST(B)?FOLLOW(C)?
User Avatar
0 votes
1 answer
19
#CD Doubt
#CD compute first and follow for S->SS+\SS*\a
#CDcompute first and follow forS->SS+\SS*\a
User Avatar
0 votes
2 answers
20
FIRST Set
S->Aa A->BD B->b | ɛ D->d | ɛ what is FIRST(S)?
S->AaA->BDB->b | ɛD->d | ɛwhat is FIRST(S)?
User Avatar
Page: