Skip to content

Added in three short sections explaining grammar #19

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

Open
mueschm wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Added in three short sections explaining grammar #19

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 14 additions & 0 deletions index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -344,10 +344,24 @@ Give examples.

### What is an ambiguous grammar?

A gramar is considered to be ambiguous if it provides more than one way to parse a string.

If we take a look at the grammer below we can see why it would be considered ambigious.

S -> A* | B*
A -> b | bB
B -> bb | bA

Now if we look at the string "bb" without the ability to look ahead we could have either parsed this intially as AA or B. Since we could have gone down multiple paths without any look ahead, this is considered to be ambigous grammar.

### What is a LL(k) grammar?

Grammar is said to be LL{k} if it it can be read from left to right and be non-ambigous when creating a left most derivation with only the ability to look k characters ahead.

### What is a LR(k) grammar?

Grammar is said to be LL{k} if it it can be read from left to right and be non-ambigous when creating a right most derivation with only the ability to look k characters ahead.

### What is Backus-Naur Form?

### What is a pushdown automaton?
Expand Down