By top-down greedy parsing (Shen et al., 2018a), which recursively splits the sentence into two constituents with minimum a, a parse tree can be formed.
because each layer has a set of a l , we have to decide to use which layer for parsing.