Introduction - If you have any usage issues, please Google them yourself
Parser to parse the input file generated token string, and the last one in the file plus a# sign, on behalf of the end of grammar reduction, the program uses a recursive subroutine method, if successful reduction outputs Success, If reduction fails, it returns reducible to token strings which element error and has a corresponding reduction is not successful Which is the grammar production