abstract:In computer science, Shift-Reduce parsing is a category of efficient, table-driven bottom-up parsing methods for computer languages and other notations formally defined by a grammar. The parsing methods most commonly used today, LR parsing and its variations, are shift-reduce methods.
Evenbeyond top-down andshift-reduceparser, NLTKalsooffers "chartparsers" thatcreatepartialhypotheses thatagivensequencecan be continued to fulfill a rule.