A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative for Sénizergues’ decidability proof (1998,2005) for nondeterministic pushdown automata with deterministic popping ε-steps, which generalized his decidability proof for language equivalence of deterministic pushdown automata.