Configurable parser Development Chronicle (v) construct a really available state machine (middle)

The previous blog wrote about how to construct a compressed push state machine for a non-terminal grammar rule, so today it's about how to connect all the grammars together. In fact, the main idea in (c) and his errata (3.5) has been said almost. But today we have to deal with the transition with information, so there are some places to pay attention to.

So here we're going to list the final state machines for a few grammars (big picture):

This column more highlights: http://www.bianceng.cn/Programming/cplus/