[Solved] LISP Assignment 2-C (Tokenizer & Parser)

Assignment 2

1. What two features would you focus on when designing a programming language? Why
2. Discuss some examples of efficiency in the Java programming language.
3. Discuss some examples of inefficiency in the Java programming language.
4. Discuss some examples of regularity in the Java programming language.
5. Discuss some examples of irregularity in the Java programming language.
6. Should a language require the declaration of variables? Languages such as Lisp and Python allow variables names to be used without declarations, while C, Java, and Ada require all variables to be declared. Discuss the requirement that variables should be declared from the point of view of readability, writability, efficiency, and security.
7. Describe some strings that are represented by the following regular expressions:
   • [-+]?[0-9]+.?[0-9]*
   • [a-z]+ and ([a-z]+|…)

9. Build the regular expression for the following:
   • Identifiers in a language that must start with an underscore character and must end in a numeric digit. The length can be any size and values in between can be any alphanumeric character.
   • A phone number with either the following formats: (888) 888-8888 or 888-888-8888
   • The VCU V Number
10. Using the grammar below, how many legal sentences are there? Why is that? Suppose white space was completely ignored in the grammar so that sentences could be written as thecompetitorseesawin. Can this grammar still be parsed? Explain
11. Add the following four operations in the proper location for the order of operations to apply to the EBNF grammar below.
    • subtraction,
    • division,
    • integer modulus division,

• exponents

11. Use the grammar above to draw the following:
    • (2 * 7 + (4 * 5)) parse tree
    • 3 * (4 * 5) + (6 + 7) abstract syntax tree
    • 3 + (4 + 2) * 6 + (7 * 8) parse tree