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:
- (30 points) Rewrite the set of productions above in Extended Backus-Naur Form (EBNF).
- (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 )
return ( z ) ;
- (35 points) Validate your answer in (2) by illustrating it with a derivation tree
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.