This is a personal assignment for class.
It will involve the following two parts:
1) PARSER: A reorganization of a grammer so priorities among operators are as specified in the C language. The syntax will be supplied. You will need to add the given grammer into a file, and stratify it to agree with operator priority. The grammer must be rewritten, instead of using the native functionalities of Bison.(Bison)
2) AST Construction: Add actions to the previously modified grammer to create an abstract syntax tree and print the AST Tree.
3) Printer: once the AST is created, design a pretty printer by traversing the AST in-order.
Please ensure that:
a) priorities are correct through use of parenthesis
b) AST is correctly built
c) The AST has minimum information to recreate the input
More information will be supplied in documentation (pdf). Deadline is July 28.
* *
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).
All portions of the assignment should be completed.
## Platform
UNIX