General Case
The parser works on strings from a particular context-free grammar.
The parser consists of
- an input buffer, holding the input string (built from the grammar)
- a stack on which to store the terminals and non-terminals from the grammar yet to be parsed
- a parsing table which tells it what (if any) grammar rule to apply given the symbols on top of its stack and the next input token
The parser applies the rule found in the table by matching the top-most symbol on the stack (row) with the current symbol in the input stream (column).
When the parser starts, the stack already contains two symbols:
where '$' is a special terminal to indicate the bottom of the stack and the end of the input stream, and 'S' is the start symbol of the grammar. The parser will attempt to rewrite the contents of this stack to what it sees on the input stream. However, it only keeps on the stack what still needs to be rewritten.
Read more about this topic: LL Parser
Famous quotes containing the words general and/or case:
“I never saw any people who appeared to live so much without amusement as the Cincinnatians.... Were it not for the churches,... I think there might be a general bonfire of best bonnets, for I never could discover any other use for them.”
—Frances Trollope (1780–1863)
“In case I conk out, this is provisionally what I have to do: I must clarify obscurities; I must make clearer definite ideas or dissociations. I must find a verbal formula to combat the rise of brutality—the principle of order versus the split atom.”
—Ezra Pound (1885–1972)