On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width