In this paper, we present a transition-base parsing framework where a specific
parser type is instantiated in terms of a set of abstract control parameters that
constrain transitions between parser states. These parameters enable a
generalization across a range of transition-based parsing algorithms, including
Arc-eager, Arc-standard, and Easy-first. This generalization provides a unified
framework that allows us to describe and compare various transition-based parsing
approaches from a theoretical and empirical perspective. This includes both
previously studied transition systems, but potentially new systems as well.