Reachable rules

Grammar tests > Reachable rules

Normally LL(1) parser like TETRA must fulfill the condition, that each production must be reachable from the start rule.

In TETRA however this principle is weakened. TETRA's family concept allows the existence of productions in the repository, which are not all subordinated to a common start rule. Nevertheless this condition is guaranteed during the execution of a TETRA program or for code production, because the TextTransformer cuts out exactly the set of rules, which are derivable from the actual chosen start rule.

This page belongs to the TextTransformer Documentation