regarding 

2 Problem — Derivation, Parse Tree, Ambi- guity, Precedence & Associativity

 

 

I need help with a solution for the questions following this section

but instead changing the problem too 

a ∧ false ∨ b → true 

 

 

CS 314Problem Set 2Sample Solution1Problem — Context-Free LanguagesAre the following languages context-free or not? If yes, specify a context-free grammar in BNF notation that generates the language. If not, give aninformalargument.All of these languages are context free. Sample sets of rules are given,but other rules may also work.1.{anbmco|m>n≥0, o>0}, with alphabet Σ ={a, b, c}< S >::=< A >< B >< C >< A >::=a < A > b|±< B >::=b < B >|b< C >::=c < C >|c2.{anb2n|n≥0}, with alphabet Σ ={a, b}< S >::=a < S > bb|±3.{wwR|w∈Σ*andwRis w in reverse}, with alphabet Σ ={a, b}< S >::=a < S > a|b < S > b|±4.{anbmcmdn|n≥0, m≥0}, with alphabet Σ ={a, b, c, d}< S >::=a < S > d|< A >|±< A >::=b < A > c|±5.{w|w has no more than 5 symbols}, with alphabet Σ={a, b}< S >::=< A >< A >< A >< A >< A >< A >::=a|b|±

Attachments:

• 1496042789-hw2-sol.pdf