 As a consequence, a language "L" is deterministic context-free if and only if "L"$ has an LR(0) grammar, where "$" is not a symbol of "L"’s alphabet.This example of LR parsing uses the following small grammar with goal symbol E