COMP 405
|
HW03: Dynamic Communications Language |
![]() ![]() ![]() ![]() ![]() ![]() ![]() |
As usual, first do your peer reviews for the previous assignments. Work with your HW03 partner(s) on the peer reviews of HW02.
In this project, you will build a program that will talk to another group's program where expressions written in one programming language on the sender will run on the receiver, even though the receiver doesn't know the language in which the expression was written.
Complete the exercises to create a working extended visitor-based parser generator that can parse a grammar given the Backus-Naur Form (BNF) of that grammar.
To do this, the receiver must implement a dynamically generated parser that will take the BNF of the sender's language and generate a parser from it. The sender will then transmit an arbitrary expression in that language that parser will then be used to build an abstract syntax tree that can be used to execute that expression.
In order to accomplish this, we must first agree upon some common notions about the language:
Direct TCP/IP networking in Java:
A new feature we will introduce with this assignment is that a draft version of your discussion of your project must be approved by a staff person by an intermediate milestone date. This is to help everyone clarify what they are doing and how they are thinking about the issues before they finish the project.
© 2015 by Stephen Wong