trianantoputra / top-down-parsing

Parsing a string with brute force & recursive descent parsing

Top Down Parsing with Brute Force & Recursive Descent Parsing

Parsing a string with brute force & recursive descent parsing. The program will detect wether the string accepted according to the pre-determined rules. This repository is archived from the 5th-semester group project on the compilation techniques course, Sriwijaya University.

Members:

• Kanda Januar Miraswan (Lecturer) - LinkedIn, Scholar
• Dwi Novitasari Instagram
• Muhammad Irfan Triananto Putra - LinkedIn

Getting Started

These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. The program is made with Javascript programming language.

Prerequisites

What things you need to install the software

• Local server - XAMPP, etc.
• Browser - Google Chrome, Firefox, etc.

Running the tests

• open the XAMPP, run Apache.
• the user manually change the script in the html line 10 depending on what type of parsing to be used.
• the user can use brute force parsing (bfp.js) or recursive decent parsing (rdp.js), use one of the following:

<script type="text/javascript" src="rdp.js"></script> // if using rdp

<script type="text/javascript" src="bfp.js"></script> // if using bfp

• open index.html on the browser
• right click on the browser and "inspect element"
• click on "console" tab

Input

• Manually type the input from the source code (bfp.js / rdp.js) on the variable "string"

string = "i/i/i*i-i+i"

Output

• The output located in the "console" tab

Sample output brute force parsing

Sample output recursive descent parsing

Documentation

• TOP DOWN PARSING, Irfan, 2018