This course provides a survey of the syntactic, semantic, and implementation features of functional, procedural, object-oriented, logic, and concurrent programming languages.
Grade of C- or better in CS-252 (Introduction to Computer Organization) and CS-315 (Data Structures), or consent of instructor.
Robert Bruce
Upon successful completion of this course, students will be able to:
In addition to in-class exercises, students will be assigned the following programming assignments outside of class. The programming assignments below will be completed as part of a team. Everyone on the team receives the same grade for the programming assignments. Detailed instructions about these assignments will be posted to Canvas. A brief description of each assignment is below:
Using procedurally-driven deterministic finite state automaton (DFA), write a program in C or C++ to identify and ignore comments for a C-like programming language. Details for this assignment will be posted to Canvas.
Given a C-like programming language grammar defined in Bacus-Naur Form (BNF), write a program in C or C++ that tokenizes an entire input file and displays the tokens as output. Details for this assignment will be posted to Canvas.
Given a C-like programming language grammar defined in Bacus-Naur Form (BNF), write a recursive descent parser in C or C++ with a procedurally-driven deterministic finite state automaton (DFA) to create a Concrete Syntax Tree (CST). Details for this assignment will be posted to Canvas.
Given a C-like programming language grammar defined in Bacus-Naur Form (BNF), write a program in C or C++ that creates a symbol table (a linked list) of all the defined variables (including their type and scope), and the names of all functions and procedures. Functions and procedures may also have an input parameter list of variables and types. These too should be present (with appropriate scope) in the symbol table. Lastly, functions have a return datatype which must be noted in the symbol table as well. Details for this assignment will be posted to Canvas.
Given a C-like programming language grammar defined in Bacus-Naur Form (BNF), write a program in C or C++ that creates an Abstract Syntax Tree (AST) based on the Concrete Syntax Tree (CST) generated in programming assignment 3 (above). An abstract syntax tree is not a clone of the parse tree. Boolean and numeric expressions in the CST should be converted to postfix notation using the Shunting Yard Algorithm. Details for this assignment will be posted to Canvas.
Write a program in C or C++ that can interpret and run applications for a C-like programming language grammar defined in Bacus-Naur Form (BNF). The interpreter must execute the program, keeping track of variables and values and the flow of control at all times. The interpreter must also account for possible syntax errors or run-time errors. Details for this assignment will be posted to Canvas.
Unlike the programming assignments one through six above, the programming project report is an individual assignment, not a team assignment. In the report, students will discuss their individual contributions and the contributions of your team mates. Additional questions pertaining to the report will be denoted on Canvas. Details for this assignment will be posted to Canvas.
Each student team will present a demonstration of their project to the class. Individual team members will each speak about their individual contributions. Students will be graded individually on their ability to communicate in a clear and concise manner, the relevancy of supplemental visual material to support their presentation, and their timing. A detailed grading rubric will be posted on Canvas on how the oral presentation will be graded. Side note: clear and concise oral presentations are very important to practice before interviewing at companies in the corporate world.
The midterm exam will based-on chapters 1, 2, 3, 4, 5, 6, and 7 of Scott’s Programming Language Pragmatics. The exam will be comprised of open-ended questions. The exam will be closed-book. You may use one A4 sheet of paper (8.5 inches width by 11 inches length) for notes during the midterm examination. You may write notes on both sides of the sheet of paper.
The final exam will based-on chapters 8, 9, 10, 11, 12, and 14 of Scott’s Programming Language Pragmatics. The exam will be comprised of open-ended questions. The exam will be closed-book. You may use one A4 sheet of paper (8.5 inches width by 11 inches length) for notes during the final examination. You may write notes on both sides of the sheet of paper.
† Graded as an individual‡ Graded as a group (each member of the group gets the same grade)
Ultimately this course is graded A, B, C, D, or F. Percentage grades are rounded to the nearest whole number. For example, a grade of 92.4% will be rounded to 92% and result in a grade of "A minus". A grade of 92.5% will be rounded to 93% and result in a grade of "A".
Absent extenuating circumstances (illness, family emergency), late submissions will be accepted under the late policy until the advertised "Until" deadline on Canvas. The late policy is minus 5% per day, and never grows more than minus 50% markdown (as long as the assignment is submitted before the final deadline via Canvas).