Find Jobs
Hire Freelancers

compiler homework

$10-30 USD

Cancelled
Posted almost 9 years ago

$10-30 USD

Paid on delivery
Written assignment-1 CSC 340 (First term 2014-2015) KSU Consider the following grammar P S SStmt | B B } | ST T } | ;B Stmt  if (Tem Pred Term) then Stmt else Stmt Stmt  do Stmt while(Term Pred Term) Stmt Identifier = Exp Exp Integer | Integer + Exp | integer-1 Exp Term  Integer | Identifier Pred = ==+!=+ <+ <= Part-I (Written Part) (a) Is the above CFG ambiguous? Is so rewrite it to resolve all ambiguities. (b) Give the first sets of the non-terminals and the follow sets of the terminals and non-terminals. (c) Give the LL(1) parsing table for this grammar. c) Is the grammar an LL(1) grammar? Why? Or why not? Due date for part-I: 25 April 2015 Part-II (Programming Part) Write an LL(1) parser after doing all necessary modifications. The input of the program should be the output of the lexical analyzer you wrote in assignement-2. The output should indicate whether the input contains a syntax error. Due date for part-II: Sunday 3 May 2015
Project ID: 7532643

About the project

Remote project
Active 9 yrs ago

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs

About the client

Flag of SAUDI ARABIA
Saudi Arabia
0.0
0
Member since Oct 19, 2014

Client Verification

Thanks! We’ve emailed you a link to claim your free credit.
Something went wrong while sending your email. Please try again.
Registered Users Total Jobs Posted
Freelancer ® is a registered Trademark of Freelancer Technology Pty Limited (ACN 142 189 759)
Copyright © 2024 Freelancer Technology Pty Limited (ACN 142 189 759)
Loading preview
Permission granted for Geolocation.
Your login session has expired and you have been logged out. Please log in again.