1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
/*******************************************************/
/* "C" Language Integrated Production System */
/* */
/* CLIPS Version 6.20 01/31/02 */
/* */
/* REORDER HEADER FILE */
/*******************************************************/
/*************************************************************/
/* Purpose: Provides routines necessary for converting the */
/* the LHS of a rule into an appropriate form suitable for */
/* the KB Rete topology. This includes transforming the */
/* LHS so there is at most one "or" CE (and this is the */
/* first CE of the LHS if it is used), adding initial */
/* patterns to the LHS (if no LHS is specified or a "test" */
/* or "not" CE is the first pattern within an "and" CE), */
/* removing redundant CEs, and determining appropriate */
/* information on nesting for implementing joins from the */
/* right. */
/* */
/* Principal Programmer(s): */
/* Gary D. Riley */
/* */
/* Contributing Programmer(s): */
/* */
/* Revision History: */
/* */
/*************************************************************/
#ifndef _H_reorder
#define _H_reorder
struct lhsParseNode;
#ifndef _H_expressn
#include "expressn.h"
#endif
#ifndef _H_ruledef
#include "ruledef.h"
#endif
#ifndef _H_pattern
#include "pattern.h"
#endif
#ifdef LOCALE
#undef LOCALE
#endif
#ifdef _REORDER_SOURCE_
#define LOCALE
#else
#define LOCALE extern
#endif
/***********************************************************************/
/* lhsParseNode structure: Stores information about the intermediate */
/* parsed representation of the lhs of a rule. */
/***********************************************************************/
struct lhsParseNode
{
unsigned short type;
void *value;
unsigned int negated : 1;
unsigned int logical : 1;
unsigned int multifieldSlot : 1;
unsigned int bindingVariable : 1;
unsigned int derivedConstraints : 1;
unsigned int userCE : 1;
unsigned int whichCE : 7;
unsigned int marked : 1;
unsigned int withinMultifieldSlot : 1;
unsigned short multiFieldsBefore;
unsigned short multiFieldsAfter;
unsigned short singleFieldsBefore;
unsigned short singleFieldsAfter;
struct constraintRecord *constraints;
struct lhsParseNode *referringNode;
struct patternParser *patternType;
short pattern;
short index;
struct symbolHashNode *slot;
short slotNumber;
int beginNandDepth;
int endNandDepth;
struct expr *networkTest;
struct lhsParseNode *expression;
void *userData;
struct lhsParseNode *right;
struct lhsParseNode *bottom;
};
LOCALE struct lhsParseNode *ReorderPatterns(void *,struct lhsParseNode *,int *);
LOCALE struct lhsParseNode *CopyLHSParseNodes(void *,struct lhsParseNode *);
LOCALE void CopyLHSParseNode(void *,struct lhsParseNode *,struct lhsParseNode *,int);
LOCALE struct lhsParseNode *GetLHSParseNode(void *);
LOCALE void ReturnLHSParseNodes(void *,struct lhsParseNode *);
LOCALE struct lhsParseNode *ExpressionToLHSParseNodes(void *,struct expr *);
LOCALE struct expr *LHSParseNodesToExpression(void *,struct lhsParseNode *);
LOCALE void AddInitialPatterns(void *,struct lhsParseNode *);
#endif
|
