The Gateway to Computer Science Excellence

0 votes

Repeat Exercise 4.3.1 on the following grammars:

- $S\rightarrow SS+\mid SS\: \ast\mid a$
- $S\rightarrow 0S1\mid 01$
- $S\rightarrow S ( S ) S\mid \epsilon$
- $S\rightarrow (L)\mid a$ and $L\rightarrow L,S\mid S$
- The following grammar for boolean expressions

- $bexpr\rightarrow bexpr\:or\:bterm\mid bterm$
- $bterm\rightarrow bterm\:and\:bfactor\mid bfactor$
- $bfactor\rightarrow not\: bfactor\mid ( bexpr )\mid true \mid false $

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

50,644 questions

56,523 answers

195,605 comments

101,286 users