An alternative LR algorithm for TAGs

Full text

(1)
(2)
(3)
(4)
(5)
(6)
(7)

Figure

Figure 1: A tree-adjoining grammar.

Figure 1:

A tree-adjoining grammar. p.3
Figure 3: Producing a finite automaton some t G I. K is the set of states, N acts as (K, N, T, s, {f}) that recognizes CS(Rt), given alphabet here, 7" is the set of transitions, s is the initial state and f is the (only) final state

Figure 3:

Producing a finite automaton some t G I. K is the set of states, N acts as (K, N, T, s, {f}) that recognizes CS(Rt), given alphabet here, 7" is the set of transitions, s is the initial state and f is the (only) final state p.5
Figure 4: Example of the construction for CS(R1), where R1 is the root node of al (Fig- ure 1)

Figure 4:

Example of the construction for CS(R1), where R1 is the root node of al (Fig- ure 1) p.5
Figure 5: The set of LR states.

Figure 5:

The set of LR states. p.6

References

Updating...