WA2 - CS 143 Compilers Handout 4 Written Assignment 2 Due...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 143 Compilers Handout 4 Written Assignment 2 Due Tuesday, October 20, 2009 This assignment asks you to prepare written answers to questions on context-free grammars, parse trees, and parsing. Each of the questions has a short answer. You may discuss this assignment with other students and work on the problems together. However, your write-up should be your own individual work. Written assignments can be turned in at the start of lecture. Alternatively, assignments can be turned in at Professor Aiken’s office in Gates 411, or submitted electronically in PDF format by following the electronic submission instructions at http://www.stanford.edu/class/cs143/policies/submit.html , by 5:00 PM on the due date. 1. Give a context-free grammar (CFG) for each of the following languages over the alphabet Σ = { 0 , 1 } : (a) All strings in the language L : { 0 i 1 j | i j 2 i i 0 } (b) All strings with an equal number of 0’s and 1’s.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

WA2 - CS 143 Compilers Handout 4 Written Assignment 2 Due...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online