glushkov_info Struct Reference

Type utilized to represent the information computed by Glushkov's algorithm from the input regular expression. More...

#include <regexp_tonfa.h>

Public Attributes
uint	size
	Number of letters in the regular expression.
bool	epsilon
	Boolean indicating whether the regular expression contains the empty word.
barray *	first
	Array of Booleans indexed by the letters. Marks the letters which start a word rexcognized by the expression.
barray *	last
	Array of Booleans indexed by the letters. Marks the letters which end a word recognized by the expression.
barray *	follow
	Array of Booleans indexed by two-letter words. Marks the two-letter words which are a factor of a word recognized by the expression.

Detailed Description

Type utilized to represent the information computed by Glushkov's algorithm from the input regular expression.

Remarks

In the array indexed by two-letter words, the word "ab" corresponds to the cell "a * size + b".

---

The documentation for this struct was generated from the following file:

• regexp_tonfa.h