Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Help!! A question to answer 2.2 #196

Open
ItsBean opened this issue Jan 25, 2022 · 2 comments
Open

Help!! A question to answer 2.2 #196

ItsBean opened this issue Jan 25, 2022 · 2 comments

Comments

@ItsBean
Copy link

ItsBean commented Jan 25, 2022

image
The answer tells me that the grammer is ambiguous by giving the example below, but the example confused me.I don't know why both trees represent the same string .
image

@magneto0124
Copy link

Look at the leaves, the upper one has abεaεbε = abab, the lower one has aεbaεbε = abab, so they are the same strings.

@melvas6
Copy link

melvas6 commented Jun 27, 2023

ambiguous parse tree

I'm very much confused with this. The strings are same. But aren't both the trees same?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants