Register

Compiler_design_LL(1)

• edited by
842 views
0 0 votes

Given answer is 3. I am getting Two entries.Check it once.

Consider the following grammar
\[
\begin{array}{l}
\mathrm{S}->\mathrm{ABA} \\
\mathrm{~A}->\mathrm{Bc}|\mathrm{dA}| \epsilon \\
\mathrm{B}->\mathrm{e} \mathrm{~A}
\end{array}
\]

How many entries have multiple productions in LL(1) table?

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · RandomNext → · Algorithm :- Hashing
← Previous in category · Protogen  eating pla...Next in category → · Syntax_Directed_tran...
Position:
Show:

Related questions

0 0 votes
1 1 answer
5.8k
5.8k views
rahuldb asked Jan 31, 2017
5,769 views
Construct LL(1) Parsing table for the following grammar
4.a. Construct the $\mathrm{LL}(1)$ parsing table for the following grammar:[05]\[\begin{array}{l}\mathrm{S} \rightarrow \mathrm{aAC} \mid \mathrm{Bb} \\\mathrm{~A} \righ...
1 1 vote
2 answers 2 answers
5.3k
5.3k views
KISHALAY DAS asked Nov 12, 2016
5,315 views
Compiler-LL(1)/LL(0)
Consider the following grammar.\[\begin{array}{l}\mathrm{S} \rightarrow \mathrm{AB} \mid \mathrm{BA} \\\mathrm{~A} \rightarrow * \mathrm{~S} \mid \mathrm{E} \\\mathrm{~B}...
1 1 vote
2 answers 2 answers
2.0k
2.0k views
Himanshu1 asked Jan 1, 2016
1,955 views
Identify LL(1) or not
Consider the following grammar G\[\begin{array}{l}\mathrm{S} \rightarrow \mathrm{aA} \mid \mathrm{B} \\\mathrm{~A} \rightarrow \mathrm{aA} \mid \mathrm{b} \\\mathrm{~B} \...
0 0 votes
2 2 answers
672
672 views
Deepalitrapti asked Jul 19, 2018
672 views
Compiler design
8:14 AM37\%Deepali bansal's doubt7 hrsJaipurCompiler DesignCS \& IT EnggWhere €,; IF THEN and all capital letters are terminal and stmt, ifstmt, whilestmt and bexpr are n...