sotostzam/ll1_compiler

This is a compiler for LL(1) types of grammar.

LL(1) Compiler ·

This is a LL(1) Parser which includes an integrated graphical user interface. Being still a work in progress, in the future it would be a full LL(1) Compiler. This application is intended for computer science students and autodidacts studying compilers or parsers.

Demo

Table of contents

• Features
• Getting Started
  • Prerequisites
  • Installing
  • Deployment
  • Usage
• Author
• Contributing
• Acknowledgments
• License

Features

• Create custom LL(1) grammar rules
• Import and export of grammar rules
• Generate of first sets, follow sets and the parsing table
• Each step is accompanied by visual feedback and explanatory text
• Seamlessly checks if a string is recognized with error reporting

Getting Started

Prerequisites

• You will need any OS able to run Java like Windows or Linux
• You must have Java JDK 8 installed, which already includes JavaFX
• You will also need an editor or an IDE like Eclipse IDE
• You can use e(fx)clipse 3.0 or newer for eclipse

Installing

1. Fork this repository on your Github account
2. Open your favorite IDE/Editor create a new javafx project
3. Change location to that folder with git bash
4. Clone your forked repository to that folder using git clone https://github.com/YOURUSERNAME/LL1_Compiler.git
5. A refresh may be required from your IDE/Editor
6. Build and run the application

Deployment

In order to deploy a runnable .jar file follow these steps:

• Go to file -> Export
• From the Java menu select Runnable JAR file
• Select launch configuration
• Select Export destination
• Double click to run the generated file

Usage

1. Launch the application
2. Click on the Import Rules tab
   • From here you can add your own rules
   • Or select some of the pre-loaded ones
   • Click the Save rules button
3. Run the first, follow and parsing table algorithms by pressing the corresponding tabs. You are also able to analytically see how each step is generated
4. Now you can analyze an input string whether it matches your grammar rules

Author

Sotirios Tzamaras · Development Lead

Contributing

As an open source software, we would be grateful if you wish to contribute bugfixes and improvements. Read our CONTRIBUTING to learn about how to report issues and how to propose bugfixes and improvements.

A special thanks to all of our contributors and testers so far:

• Vasileios Angelis (Follow algorithm and Unit testing)

Acknowledgments

The idea of this application was founded within the framework of the course named "Principles of Languages and Translators", taught by assistant professor Stavros Adam at the university of Ioannina (Former Technological Educational Institute of Epirus).

License

This project is licensed under the GNU General Public Version 3 License - see the LICENSE file for details

ll1_compiler's Issues

Build tool needed for ease of development

A build tool is needed to be configured (e.g Grandle), so that it is easier to build the application without the need for an IDE or editor.

Input grammar is not checked to conform to type LL(1)

There is currently no check mechanism to check whether an input grammar complies with the type LL(1). The application just checks if the input character set matches the build-in recognizable one.

Upgrading FollowSets Algorithm

Optimization to follow sets algorithm for increased speed.

Create JUnit testing infrastructure

Currently there is not testing infrastructure. We need to create one and this means we have to modify classes so they return only results and not update the GUI at the same time.