void DFA::prepare(uint32_t & max_fill)
{
- State *s;
- uint32_t i;
-
bUsedYYBitmap = false;
findSCCs();
uint32_t nRules = 0;
- for (s = head; s; s = s->next)
+ for (State * s = head; s; s = s->next)
{
s->depth = maxDist(s);
if (max_fill < s->depth)
// mark backtracking points
bSaveOnHead = false;
- for (s = head; s; s = s->next)
+ for (State * s = head; s; s = s->next)
{
if (s->rule)
{
- for (i = 0; i < s->go.nSpans; ++i)
+ for (uint32_t i = 0; i < s->go.nSpans; ++i)
{
if (s->go.span[i].to && !s->go.span[i].to->rule)
{
State *accept = NULL;
State *accfixup = NULL;
- for (s = head; s; s = s->next)
+ for (State * s = head; s; s = s->next)
{
State * ow;
ow = rules[s->rule->accept];
}
- for (i = 0; i < s->go.nSpans; ++i)
+ for (uint32_t i = 0; i < s->go.nSpans; ++i)
{
if (!s->go.span[i].to)
{
delete [] rules;
// split ``base'' states into two parts
- for (s = head; s; s = s->next)
+ for (State * s = head; s; s = s->next)
{
s->isBase = false;
if (s->link)
{
- for (i = 0; i < s->go.nSpans; ++i)
+ for (uint32_t i = 0; i < s->go.nSpans; ++i)
{
if (s->go.span[i].to == s)
{
// find ``base'' state, if possible
findBaseState();
- for (s = head; s; s = s->next)
+ for (State * s = head; s; s = s->next)
{
s->go.init (s);
}