Among the advantages of transition-based parsers are the linear time complexity of many of them and the possibility of using rich feature models (Zhang and Nivre, 2011).
many transition-based parsers (Nivre et al., 2004;Attardi, 2006;Sagae and Tsujii, 2008;Nivre, 2009;Huang and Sagae, 2010;Gómez-Rodríguez and Nivre, 2010) are stack-based (Nivre, 2008), meaning that they keep a stack of partially processed tokens and an input buffer of unread tokens.