Programming #5 Implementation of a complete interpreter for the full Biola language

Option 1: Enhance what you have from programming #4 to implement your own interpreter class to do the job.

 

Option 2:Use the 95%  implemented interpreter class provided in the skeleton framework

 

Reference 1: Syntax of BIOLA: our target programming language.

Reference 2: Use the sample interpreter (download and unzip this zip file) to see how it can execute this non-trivial sample Biola source program (prime.txt) to repeatedly find all the prime numbers less than an integer value n given by the user.