Lines Matching full:nstate
228 var nstate = 0 // number of states
363 optst = make([][]int, nstate)
1750 nstate = 0
1762 nstate = 1
1775 for i := 0; i < nstate; i++ {
1956 fmt.Fprintf(foutput, "\nState %v, nolook = %v\n", i, nolook)
1974 p1 := pstate[nstate]
1975 p2 := pstate[nstate+1]
2024 pstate[nstate+1] = pstate[nstate] // delete last state
2045 pstate[nstate+2] = p2
2046 if nstate+1 >= NSTATES {
2050 mstates[nstate] = ntstates[c-NTBASE]
2051 ntstates[c-NTBASE] = nstate
2053 mstates[nstate] = tstates[c]
2054 tstates[c] = nstate
2056 tystate[nstate] = MUSTDO
2057 nstate++
2058 return nstate - 1
2066 fmt.Fprintf(foutput, "putitem(%v), state %v\n", writem(p), nstate)
2068 j := pstate[nstate+1]
2081 pstate[nstate+1] = j
2199 stateTable = make([]Row, nstate)
2205 for i := 0; i < nstate; i++ {
2427 fmt.Fprintf(foutput, "\nstate %v\n", i)
2492 for j := 0; j < nstate; j++ {
2503 for k := j; k < nstate; k++ {
2517 for j := 0; j < nstate; j++ {
2524 for j := 0; j < nstate; j++ {
2583 aryfil(tystate, nstate, 0)
2584 for i = 0; i < nstate; i++ {
2632 for i = 0; i < nstate; i++ {
2686 for i = 0; i < nstate; i++ {
2730 for i := 0; i < nstate; i++ {
2814 for j := 0; j < nstate; j++ {
2865 arout("Pact", indgo, nstate)
2886 aryfil(temp1, nstate, -1000)
2897 arout("Chk", temp1, nstate)
2898 arout("Def", defact, nstate)
3075 fmt.Fprintf(foutput, "%v grammar rules, %v/%v states\n", nprod, nstate, NSTATES)
3079 fmt.Fprintf(foutput, "%v extra closures\n", zzclose-2*nstate)
