Restore LEX rules from generated cpp tables

IMPORTANT: KNOWLEDGE OF YACC or BISON or ANTLR ARE REQUIRED. Without them you couldn't complete this task

IMPORTANT: this is a strict algorithmic task, you will have to do a lot of math here

Problem:

- There is C code, generated by alex (scheme.h + scheme.c), which has all transition tables, states, matches and backup rules;

- There is no original [login to view URL] file;

- There are 25 such cases: scheme1.h + scheme1.c, scheme2.h + scheme2.c, …, scheme25.h + scheme25.c

- All original [login to view URL] files are lost;

Goal:

- Write a tool, which will take existed scheme1.h + scheme1.c and generates [login to view URL] for it.

- Only lex restoration is needed, ayacc files are ok

All info is here

[login to view URL]

Java Algoritma C++ Programlama C# Programlama

Proje NO: #24962971

Proje hakkında