can someone help with just first state of parser?

The Gateway to Computer Science Excellence

0 votes

$E \rightarrow E + T \hspace{5px} | \hspace{5px} T$

$T \rightarrow TF \hspace{5px} | \hspace{5px} F $

$F \rightarrow F^{*} \hspace{5px} | \hspace{5px} (E) \hspace{5px} | \hspace{5px} a \hspace{5px} | \hspace{5px} b \hspace{5px} | \hspace{5px} \epsilon $

Construct the LALR sets of items and the parse table for the above grammar.

$T \rightarrow TF \hspace{5px} | \hspace{5px} F $

$F \rightarrow F^{*} \hspace{5px} | \hspace{5px} (E) \hspace{5px} | \hspace{5px} a \hspace{5px} | \hspace{5px} b \hspace{5px} | \hspace{5px} \epsilon $

Construct the LALR sets of items and the parse table for the above grammar.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.4k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.7k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,666 questions

56,167 answers

193,838 comments

94,013 users