For example, in Prolog the normal binary tree structure is often implemented recursively: is the well-known Prolog notation for the tree diagram in which S goes to NP and VP.
in order to process Japanese sentences efficiently we need to take into account when lexical rules are applied together with transition rules.