Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a Simple precedence parser is a type of bottom-up parser for context-free grammars that can be used only by Simple precedence grammars. The implementation of the parser is quite similar to the generic bottom-up parser. A stack is used to store a viable prefix of a sentential form from a rightmost derivation. Symbols lessdot, dot = and gtrdot are used to identify the pivot, and to know when to Shift or when to Reduce.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.