Aspect | Top-Down Parser | Bottom-Up Parser |
---|---|---|
Approach | Starts from the highest level and works downwards. | Starts from the lowest level and builds upwards. |
Analogy | Reading a story: starts from the title and reads down. | Solving a puzzle: starts with pieces, builds upwards. |
Parsing Strategy | Begins with the start symbol and expands it. | Begins with terminal symbols, combines to form the start symbol. |
Prediction Capability | Less predictive without lookahead. | More predictive with proper lookahead. |
Example | Recipe: starts with dish name, breaks down to steps. | Sentence: starts with words, builds to complete sentence. |
Efficiency | Can be less efficient due to backtracking. | Generally more efficient with proper algorithms. |
1.Every grammar must be recursive in nature.
2.Each grammar must be left factored.