plc quiz 2 practice

Usually included with grammars to help make choices when the grammar is not clear

Disambiguating Rule

All grammars are created equal

False

An LL PDA have several states, while a LR PDA, only a single state(not counting an accepting state).

False

LL parsing often uses a queue to create the parse tree

False

LR is known as "top-down" parsing

False

LL stands for:

Left-to-Right Leftmost derivation

LR stands for:

Left-to-Right Rightmost derivation

For any CFG, a parser can be written to run in O(N^3) time

TRUE

LL(2) means the parse can look ahead at most 2 tokens

True