Rewrite the set of productions below in Extended Backus-Naur Form (EBNF).Set of Productions:P01:FN→FN–HEAD FN–BODYP02:FN–HEAD→TYPE id ( PARAM–LIST )P03:TYPE→charP04:TYPE→intP05:TYPE→realP06:PARAM–LIST→TYPE idP07:PARAM–LIST→PARAM–LIST , TYPE idP08:FN–BODY→{ VAR–DECL STMT return ( EXPRESN ) ; }P09:VAR–DECL→λP10:VAR–DECL→TYPE ID–LIST ;P11:VAR–DECL→VAR–DECL TYPE ID–LIST ; P12:ID–LIST→idP13:ID–LIST→ID–LIST , idP14:STMT→λP15:STMT→SIMPLE–STMTP16:STMT→SELECT–STMTP17:STMT→REPEAT–STMTP18:STMT→SEQUENCE–STMTP19:SIMPLE–STMT→ASSIGN–STMTP20:SIMPLE–STMT→FN–CALL–STMTP21:ASSIGN–STMT→var = EXPRESN ;P22:EXPRESN→ARITH–EXPP23:EXPRESN→BOOL–EXPP24:ARITH–EXP→TERMP25:ARITH–EXP→ARITH–EXP ADD–OP TERMP26:ADD–OP→+P27:ADD–OP→–P28:TERM→FACP29:TERM→TERM MUL–OP FACP30:MUL–OP→*P31:MUL–OP→/P32:FAC→( ARITH–EXP )P33:FAC→OPDP34:OPD→varP35:OPD→constP36:BOOL–EXP→RELN–EXPP37:BOOL–EXP→LOGIC–EXPP38:RELN–EXP→OPD RELN–OPR OPDP39:RELN–OPR→==P40:RELN–OPR→!=P41:RELN–OPR→<P42:RELN–OPR→<=P43:RELN–OPR→>P44:RELN–OPR→>=P45:LOGIC–EXP→OPD LOGIC–OPR OPDP46:LOGIC–EXP→LOGIC–OPR OPDP47:LOGIC–OPR→andP48:LOGIC–OPR→orP49:LOGIC–OPR→notP50:FN–CALL–STMT→id ( ARG–LIST ) ;P51:ARG–LIST→λP52:ARG–LIST→idP53:ARG–LIST→ARG–LIST , idP54:SELECT–STMT→if CONDITION STMT else STMTP55:CONDITION→( BOOL–EXP )P56:REPEAT–STMT→DO–STMTP57:REPEAT–STMT→WHILE–STMTP58:DO–STMT→do { STMT } while CONDITION ;P59:WHILE–STMT→while CONDITION do { STMT } ;P60:SEQUENCE–STMT→STMT STMT

Extended Backus-Naur Form : EBNF is a way to specify a formal language grammar. A formal language is…

Answered: Rewrite the set of productions below in…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Rewrite the set of productions below in Extended Backus-Naur Form (EBNF).

Set of Productions:

P01:	FN	→	FN–HEAD FN–BODY
P02:	FN–HEAD	→	TYPE id ( PARAM–LIST )
P03:	TYPE	→	char
P04:	TYPE	→	int
P05:	TYPE	→	real
P06:	PARAM–LIST	→	TYPE id
P07:	PARAM–LIST	→	PARAM–LIST , TYPE id
P08:	FN–BODY	→	{ VAR–DECL STMT return ( EXPRESN ) ; }
P09:	VAR–DECL	→	λ
P10:	VAR–DECL	→	TYPE ID–LIST ;
P11:	VAR–DECL	→	VAR–DECL TYPE ID–LIST ;
P12:	ID–LIST	→	id
P13:	ID–LIST	→	ID–LIST , id
P14:	STMT	→	λ
P15:	STMT	→	SIMPLE–STMT
P16:	STMT	→	SELECT–STMT
P17:	STMT	→	REPEAT–STMT
P18:	STMT	→	SEQUENCE–STMT
P19:	SIMPLE–STMT	→	ASSIGN–STMT
P20:	SIMPLE–STMT	→	FN–CALL–STMT
P21:	ASSIGN–STMT	→	var = EXPRESN ;
P22:	EXPRESN	→	ARITH–EXP
P23:	EXPRESN	→	BOOL–EXP
P24:	ARITH–EXP	→	TERM
P25:	ARITH–EXP	→	ARITH–EXP ADD–OP TERM
P26:	ADD–OP	→	+
P27:	ADD–OP	→	–
P28:	TERM	→	FAC
P29:	TERM	→	TERM MUL–OP FAC
P30:	MUL–OP	→	*
P31:	MUL–OP	→	/
P32:	FAC	→	( ARITH–EXP )
P33:	FAC	→	OPD
P34:	OPD	→	var
P35:	OPD	→	const
P36:	BOOL–EXP	→	RELN–EXP
P37:	BOOL–EXP	→	LOGIC–EXP
P38:	RELN–EXP	→	OPD RELN–OPR OPD
P39:	RELN–OPR	→	==
P40:	RELN–OPR	→	!=
P41:	RELN–OPR	→	<
P42:	RELN–OPR	→	<=
P43:	RELN–OPR	→	>
P44:	RELN–OPR	→	>=
P45:	LOGIC–EXP	→	OPD LOGIC–OPR OPD
P46:	LOGIC–EXP	→	LOGIC–OPR OPD
P47:	LOGIC–OPR	→	and
P48:	LOGIC–OPR	→	or
P49:	LOGIC–OPR	→	not
P50:	FN–CALL–STMT	→	id ( ARG–LIST ) ;
P51:	ARG–LIST	→	λ
P52:	ARG–LIST	→	id
P53:	ARG–LIST	→	ARG–LIST , id
P54:	SELECT–STMT	→	if CONDITION STMT else STMT
P55:	CONDITION	→	( BOOL–EXP )
P56:	REPEAT–STMT	→	DO–STMT
P57:	REPEAT–STMT	→	WHILE–STMT
P58:	DO–STMT	→	do { STMT } while CONDITION ;
P59:	WHILE–STMT	→	while CONDITION do { STMT } ;
P60:	SEQUENCE–STMT	→	STMT STMT

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions