The Gateway to Computer Science Excellence
0 votes

Repeat Exercise 4.3.1 on the following grammars:

  1. $S\rightarrow SS+\mid SS\: \ast\mid a$
  2. $S\rightarrow 0S1\mid 01$
  3. $S\rightarrow S ( S ) S\mid \epsilon$
  4. $S\rightarrow (L)\mid a$ and $L\rightarrow L,S\mid S$
  5. 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 $
in Compiler Design by Veteran (59.1k points)
edited by | 24 views

Please log in or register to answer this question.

Related questions

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
50,737 questions
57,341 answers
105,210 users