Then, for each ATG, we attempt at most one bracketing and adjoinings with at most 2n+1 other entries for which there can be (2n + 1)f (n) ATGs.
each entry can be processed in worst case time O(n 3 f (n) 2 ).