COP4610 Spring 2006 Homework Assignment 1
COP4020 Homework Assignment 1
1. (40 points) Errors in a computer program can be classified according to when they are detected and, if they are detected at compile time, what part of the compiler detects them. Assuming we use C/C++/java, give an example of each of the following.
a) A lexical error, detected by the scanner (hint: the scanner accepts only ASCII characters that are legal to use in C/C++)
b) A syntax error, detected by the parser
c) A static semantic error, detected by semantic analysis
d) A dynamic semantic error, detected by the code generated by the compiler
2. (30 points) Convert the regular expression a ( a | b a)* b*
to NFAs using the NFA equivalents (base case, concatenation, alternation, Kleene closure) of the regular expression operations as can be found on page 55 and 56 in the textbook.
3. (30 points) Write the regular expressions for the following
(a) the set that includes four keywords ‘int’, ‘while’, ‘for’, and ‘case’ in C++.
(b) the set of floating point numbers of the form X ‘.’ Y ‘e’ Z where X, Y, and Z are simple sequences of digits and ‘e’ is the letter e. For example 1.0002e12 is one example of such number.
(c ) the set of all possible words formed by upper and lower case letters, ending with letter ‘a’ or ‘b’.
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related searches
- online homework assignment help
- photosynthesis homework 1 answer key
- free printable homework assignment sheets
- homework assignment sheet template
- lesson 1 homework practice
- daily homework assignment sheet printable
- lesson 1 homework practice lines
- lesson 1 homework practice answers
- college homework assignment template
- unit 1 assignment sequences and series
- homework 1 problems timothy johnson
- algebra 1 homework solver