The correspondence between LCFRS string tuples and MBOT tree yields gives us our first result: From a given MBOT, construct an LCFRS as described previously.
for all i, 1 ≤ p(i) ≤ n. Given this notation, the LCFRS rule corresponding to the MBOT rule l → r is constructed as S 0 → g(S 1 , S 2 , .