The language is represented in the form of a number of rules. These rules are used to reduce the sentence to the symbol S. If this reduction succeeds, then the sentence is valid. Here is an example of simple bottom-up parsing of natural language:
