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.

Sign up for GitHub

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

Jump to bottom

Questions in a3 written part #3

Open

shamy1997 opened this issue Aug 21, 2019 · 1 comment

shamy1997 commented Aug 21, 2019 •

edited

Loading

2(b) : A sentence containing n words will be parsed in how many steps ?

I think it should need 2*n steps. Because steps include SHIFT.

shamy1997 changed the title ~~Question in a3 written part~~ Questions in a3 written part

chang-zy commented Jun 4, 2023

I have the same idea with you.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment