troubleshooting Question

BNF grammer

Avatar of shahrine99
shahrine99 asked on
Pascal
4 Comments1 Solution2116 ViewsLast Modified:
The following BNF grammer describes a Pascal-like syntax for declarations:
<decl_list> -> <decl> ; <decl_list>
                          | <decl>
<decl> -> <identifier> : <type>
<type> -> integar
            | real
            | record <decl_list> end
<identifier> -> a | b | c

Using this grammer, give a parse tree and a leftmost derivation for the following sentence:

a : record b : integer; c : real end
ASKER CERTIFIED SOLUTION
AmigoJack

Our community of experts have been thoroughly vetted for their expertise and industry experience.

Join our community to see this answer!
Unlock 1 Answer and 4 Comments.
Start Free Trial
Learn from the best

Network and collaborate with thousands of CTOs, CISOs, and IT Pros rooting for you and your success.

Andrew Hancock - VMware vExpert
See if this solution works for you by signing up for a 7 day free trial.
Unlock 1 Answer and 4 Comments.
Try for 7 days

”The time we save is the biggest benefit of E-E to our team. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange.

-Mike Kapnisakis, Warner Bros