Slr Grammar (Paperback)

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, an SLR grammar is a class of formal grammar that can be parsed by a simple LR parser.A rule of the form B y. within a state of a SLR(1) automaton is said to be irreducible or in a reduce state because it has been completely expanded and is incapable of undergoing any shift transition. Rules in this state will have a dot (the current look-ahead position) located at the rightmost end of its RHS (Right Hand Side).