Question: Compiler construction 2. Write a regular expression to describe a CHUNK where a CHUNK is the same as a chunk (defined above) but is allowed
2. Write a regular expression to describe a "CHUNK" where a CHUNK is the same as a chunk (defined above) but is allowed to have any amount of nesting. (If necessary, you may use a grammar instead of a regular expression for this problem). Examples: {aa} {no}a {a{}aa{bob}} {a}}{{a} {a{{a)a)a} {tom}{bob) yes, these 3 are CHUNKS no, none of these 3 are CHUNKS_ 2. Write a regular expression to describe a "CHUNK" where a CHUNK is the same as a chunk (defined above) but is allowed to have any amount of nesting. (If necessary, you may use a grammar instead of a regular expression for this problem). Examples: {aa} {no}a {a{}aa{bob}} {a}}{{a} {a{{a)a)a} {tom}{bob) yes, these 3 are CHUNKS no, none of these 3 are CHUNKS_
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
