Member Avatar for bmcutler011

Given the following grammar.

S --> S[S] | A (empty list)

1. construct a leftmost deriviation
2. rightmost deriviation
3. parse tree

The problem:

[ [ ] [ [ ] ] ]

  • 2 Contributors
  • 1 Reply
  • 46 Views
  • 13 Hours Discussion Span
  • Latest Post Latest Post by thoughtcoder
Member Avatar for thoughtcoder

What. What do you want. Do you want this problem solved? Maybe you should solve it, then.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.