Abelian complexity of infinite words associated with quadratic Parry numbers