From this, we conclude that an LCFRS of fanout ϕ in which all composition operations are either concatenation operations, wrapping operations, or operations of rank 0 or 1, can be parsed in time O(|w| 2ϕ+2 ).
nullary and unary composition operations do not affect this worst-case complexity, since their associated deduction steps can never have more than 2ϕ indexes.