Is it possible to build a parsing algorithm that build a parse tree using a top-down method that simulate a derivation process for regular expressions, like we do for type 2 languages?
My guess
Given a regular expression r, build its FSA, then obtain the grammar that generate r in order to build a parse tree