Top structure of a DFA. [詳細]
#include <dfa.h>
DFA_INFOのコラボレーション図
変数 | |
| DFA_STATE * | st |
| Array of all states. | |
| int | maxstatenum |
| Number of maximum allocated states. | |
| int | state_num |
| Total number of states actually defined. | |
| int | arc_num |
| Total number of arcs. | |
| int | term_num |
| Total number of categories. | |
| int ** | cp |
Store constraint whether c2 can follow c1. | |
| int * | cplen |
| Lengthes of each bcp. | |
| int * | cpalloclen |
| Allocated lengthes of each cp. | |
| int * | cp_begin |
Store constraint whether c can appear at beginning of sentence. | |
| int | cp_begin_len |
| Length of cp_begin. | |
| int | cp_begin_alloclen |
| Allocated length of cp_begin. | |
| int * | cp_end |
Store constraint whether c can appear at end of sentence. | |
| int | cp_end_len |
| Length of cp_end. | |
| int | cp_end_alloclen |
| Allocated length of cp_end. | |
| TERM_INFO | term |
| Information of terminal symbols (category) | |
| boolean * | is_sp |
| TRUE if the category contains only sp word. | |
| WORD_ID | sp_id |
| Word ID of short pause word. | |
説明
この構造体の説明は次のファイルから生成されました:
- libsent/include/sent/dfa.h
