Paper on grammars | Computer Science homework help

Objective:To acquire a comprehensive understanding of the application of grammars and formal language theory to computing languages.Given:

Consider the following 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

Instructions:

  1. (30 points)   Rewrite the set of productions above in Extended Backus-Naur Form (EBNF).
  1. (35 points)   Using a Push Down Automaton (PDA), determine if the following function is valid code according to the given set of productions.
int Max ( int x, int y ) 
    { 
        int z ; 

        if ( x >y ) 
            z = x ; 
        else 
            z = y ; 

        return ( z ) ; 
    }

 

  1. (35 points)   Validate your answer in (2) by illustrating it with a derivation tree

Deliverable:

Submit a paper Times New Roman font, 12 pt., double-space lines).   The project must contain an introduction which includes the purpose of the project.  

 

 

 

 

I attached the answers to 1 and 2 just look to make sure correct and write a paper. 

Order a unique copy of this paper
(550 words)

Approximate price: $22

Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency