Convert the following grammar into LL(1) grammar then write a Java -- 3

Convert the following grammar into LL(1) grammar then write a Java or C++ program that uses the

LL(1) method to decide whether a given string can be derived in the grammar. If the sentence is

derivable, your program should output the derivation of the sentence.

program → data_decls func_list

func_list → ɛ | func func_list

func → func_decl ; | func_decl { data_decls statements }

func_decl → type_name ID ( parameter_list )

type_name → int | void | decimal

parameter_list → ɛ | void | non-empty_list

non-empty_list → type_name ID | non-empty_list , type_name ID

data_decls → ɛ | type_name id_list ; data_decls

id_list → id | id_list , id

id → ID | ID [ expression ]

block_statements → { statements }

statements → ɛ | statement statements

statement → assignment | func_call | return_statement

assignment → id = expression ;

func_call → ID ( expr_list ) ;

expr_list → ɛ | non-empty_expr_list

non-empty_expr_list → expression | non-empty_expr_list , expression

return_statement → return expression ; | return ;

expression → term | expression addop term

addop → + | -

term → factor | term mulop factor

mulop → * | /

factor → ID | ID [ expression ] | ID ( expr_list ) | NUMBER | ( expression )

Java Computer Science

Project ID: #24683281

About the project