In this programming assignment, you will be building a parser for a simple programming language. The syntax definitions of the small programming language, called Pascal-Like Simple Language (PLSL), are given below using EBNF notations. The PLSL syntax has some features similar to the well-known Pascal Language. Your implementation of a parser to the language is based on the following grammar rules specified in EBNF notations.Prog ::= PROGRAM IDENT; DeclBlock ProgBodyDeclBlock ::= VAR {DeclStmt;}DeclStmt ::= Ident {, Ident} : (Integer | Real | String)ProgBody ::= BEGIN {Stmt;} ENDStmt ::= AssigStmt | IfStmt | WriteLnStmt | ForStmtWriteLnStmt ::= WRITELN (ExprList)IfStmt ::= IF ( LogicExpr ) THEN Stmt [ELSE Stmt]ForStmt ::= FOR Var := ICONST (TO | DOWNTO) ICONST DO StmtAssignStmt ::= Var := ExprExprList ::= Expr {, Expr}Expr ::= Term {(+|-) Term}Term ::= SFactor {( * | / ) SFactor}SFactor ::= [(+ | -)] FactorLogicExpr ::= Expr (= | > | Var ::= IDENTFactor ::= IDENT | ICONST | RCONST | SCONST | (Expr)Parser Requirements:Implement a recursive-descent parser for the given PLSP language. You may use the lexical analyzer you wrote for Programming Assignment 1, OR you may use the provided implementation when it is posted. The parser should provide the following:The results of an unsuccessful parsing are a set of error messages printed by the parser functions, as well as the error messages that might be detected by the lexical analyzer.If the parser fails, the program should stop after the parser function returns.The assignment does not specify the exact error messages that should be printed out by the parser; however, the format of the messages should be the line number, followed by a colon and a space, followed by some descriptive text. Suggested messages might include “No statements in program”, “Invalid statement”, “Missing Right Parenthesis”, “Undefined Variable”, “Missing END”, etc.Provided FilesYou are given the header file for the parser, “parse.h” andan incomplete file for the “parse.cpp”. You should use “parse.cpp” to complete the implementation of the parser.In addition, “lex.h”, “lex.cpp”, and “prog2.cpp” files are also provided. See the the descriptions of the files in the programming assignment sheet.a month ago i gave PA1 assignment so based on that have to work pa 2 assignment highly recommended expert Vibhav work on this he has done PA 1 assignment so he knows about this projectuse this website to make code vedio is provided to find more informationhttps://canvas.njit.edu/ucid- pp222password- Princep411$

In this programming assignment, you will be building a parser for a simple programming language. The syntax definitions of the small programming language, called Pascal-Like Simple Language (PLSL),...

3 answer below »

In this programming assignment, you will be building a parser for a simple programming language. The syntax definitions of the small programming language, called Pascal-Like Simple Language (PLSL), are given below using EBNF notations. The PLSL syntax has some features similar to the well-known Pascal Language. Your implementation of a parser to the language is based on the following grammar rules specified in EBNF notations.

Prog ::= PROGRAM IDENT; DeclBlock ProgBody
DeclBlock ::= VAR {DeclStmt;}
DeclStmt ::= Ident {, Ident} : (Integer | Real | String)
ProgBody ::= BEGIN {Stmt;} END
Stmt ::= AssigStmt | IfStmt | WriteLnStmt | ForStmt
WriteLnStmt ::= WRITELN (ExprList)
IfStmt ::= IF ( LogicExpr ) THEN Stmt [ELSE Stmt]
ForStmt ::= FOR Var := ICONST (TO | DOWNTO) ICONST DO Stmt
AssignStmt ::= Var := Expr
ExprList ::= Expr {, Expr}
Expr ::= Term {(+|-) Term}
Term ::= SFactor {( * | / ) SFactor}
SFactor ::= [(+ | -)] Factor
LogicExpr ::= Expr (= | > |
Var ::= IDENT
Factor ::= IDENT | ICONST | RCONST | SCONST | (Expr)

Parser Requirements:

Implement a recursive-descent parser for the given PLSP language. You may use the lexical analyzer you wrote for Programming Assignment 1, OR you may use the provided implementation when it is posted. The parser should provide the following:

The results of an unsuccessful parsing are a set of error messages printed by the parser functions, as well as the error messages that might be detected by the lexical analyzer.
If the parser fails, the program should stop after the parser function returns.
The assignment does not specify the exact error messages that should be printed out by the parser; however, the format of the messages should be the line number, followed by a colon and a space, followed by some descriptive text. Suggested messages might include “No statements in program”, “Invalid statement”, “Missing Right Parenthesis”, “Undefined Variable”, “Missing END”, etc.

Provided Files

You are given the header file for the parser, “parse.h” andan incomplete file for the “parse.cpp”. You should use “parse.cpp” to complete the implementation of the parser.In addition, “lex.h”, “lex.cpp”, and “prog2.cpp” files are also provided. See the the descriptions of the files in the programming assignment sheet.

a month ago i gave PA1 assignment so based on that have to work pa 2 assignment highly recommended expert Vibhav work on this he has done PA 1 assignment so he knows about this project

use this website to make code vedio is provided to find more information

https://canvas.njit.edu/

ucid- pp222

password- Princep411$

pa-2-building-a-parser-spring-2022-lcepa1ad.pdf pa2-vedio-1ctstryl.mov screen-shot-2022-03-22-at-112831-am-gxdrvewt-jaqm4bzs.png program-1-f-nt3dwh3m-hxdqbovj.pdf

Answered 11 days After Mar 22, 2022

Solution

Pawan answered on Apr 03 2022

110 Votes

SOLUTION.PDF

In this programming assignment, you will be building a parser for a simple programming language. The syntax definitions of the small programming language, called Pascal-Like Simple Language (PLSL),...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment