if (dfa_size<=dfa_allocated){\r
/* need to redo array */\r
if (!dfa_array){\r
- /* need some to do inital allocation */\r
+ /* need some to do initial allocation */\r
dfa_size=dfa_allocated+DFA_MIN;\r
dfa_array=(dfa_node **) malloc(sizeof(dfa_node*)*\r
dfa_size);\r
}\r
\r
\r
-/* past a pointer to the start start of the nfa graph\r
+/* past a pointer to the start of the nfa graph\r
* nfa_to_dfa convers this graph to dfa. The function returns\r
* a pointer to the first dfa state.\r
* NOTE: The function that prints out the table will have to figure out how\r
#endif\r
\r
/* Returns a pointer to a dfa node that has the same nfa nodes in it.\r
- * This may or maynot be a newly created node.\r
+ * This may or may not be a newly created node.\r
*/\r
dfa_node *\r
#ifdef __USE_PROTOS\r