mirror of
https://github.com/ZDoom/qzdoom.git
synced 2024-11-14 00:21:34 +00:00
cf11cbdb30
SVN r4 (trunk)
174 lines
3.5 KiB
C++
174 lines
3.5 KiB
C++
/* $Id: dfa.h,v 1.5 2004/05/13 02:58:17 nuffer Exp $ */
|
|
#ifndef _dfa_h
|
|
#define _dfa_h
|
|
|
|
#include <iosfwd>
|
|
#include "re.h"
|
|
|
|
extern void prtCh(std::ostream&, uchar);
|
|
extern void printSpan(std::ostream&, uint, uint);
|
|
|
|
class DFA;
|
|
class State;
|
|
|
|
class Action {
|
|
public:
|
|
State *state;
|
|
public:
|
|
Action(State*);
|
|
virtual void emit(std::ostream&, bool&) = 0;
|
|
virtual bool isRule() const;
|
|
virtual bool isMatch() const;
|
|
virtual bool readAhead() const;
|
|
};
|
|
|
|
class Match: public Action {
|
|
public:
|
|
Match(State*);
|
|
void emit(std::ostream&, bool&);
|
|
bool isMatch() const;
|
|
};
|
|
|
|
class Enter: public Action {
|
|
public:
|
|
uint label;
|
|
public:
|
|
Enter(State*, uint);
|
|
void emit(std::ostream&, bool&);
|
|
};
|
|
|
|
class Save: public Match {
|
|
public:
|
|
uint selector;
|
|
public:
|
|
Save(State*, uint);
|
|
void emit(std::ostream&, bool&);
|
|
bool isMatch() const;
|
|
};
|
|
|
|
class Move: public Action {
|
|
public:
|
|
Move(State*);
|
|
void emit(std::ostream&, bool&);
|
|
};
|
|
|
|
class Accept: public Action {
|
|
public:
|
|
uint nRules;
|
|
uint *saves;
|
|
State **rules;
|
|
public:
|
|
Accept(State*, uint, uint*, State**);
|
|
void emit(std::ostream&, bool&);
|
|
};
|
|
|
|
class Rule: public Action {
|
|
public:
|
|
RuleOp *rule;
|
|
public:
|
|
Rule(State*, RuleOp*);
|
|
void emit(std::ostream&, bool&);
|
|
bool isRule() const;
|
|
};
|
|
|
|
class Span {
|
|
public:
|
|
uint ub;
|
|
State *to;
|
|
public:
|
|
uint show(std::ostream&, uint);
|
|
};
|
|
|
|
class Go {
|
|
public:
|
|
uint nSpans;
|
|
Span *span;
|
|
public:
|
|
void genGoto(std::ostream&, State *from, State*, bool &readCh);
|
|
void genBase(std::ostream&, State *from, State*, bool &readCh);
|
|
void genLinear(std::ostream&, State *from, State*, bool &readCh);
|
|
void genBinary(std::ostream&, State *from, State*, bool &readCh);
|
|
void genSwitch(std::ostream&, State *from, State*, bool &readCh);
|
|
void compact();
|
|
void unmap(Go*, State*);
|
|
};
|
|
|
|
class State {
|
|
public:
|
|
uint label;
|
|
RuleOp *rule;
|
|
State *next;
|
|
State *link;
|
|
uint depth; // for finding SCCs
|
|
uint kCount;
|
|
Ins **kernel;
|
|
bool isBase:1;
|
|
Go go;
|
|
Action *action;
|
|
public:
|
|
State();
|
|
~State();
|
|
void emit(std::ostream&, bool&);
|
|
friend std::ostream& operator<<(std::ostream&, const State&);
|
|
friend std::ostream& operator<<(std::ostream&, const State*);
|
|
};
|
|
|
|
class DFA {
|
|
public:
|
|
uint lbChar;
|
|
uint ubChar;
|
|
uint nStates;
|
|
State *head, **tail;
|
|
State *toDo;
|
|
public:
|
|
DFA(Ins*, uint, uint, uint, Char*);
|
|
~DFA();
|
|
void addState(State**, State*);
|
|
State *findState(Ins**, uint);
|
|
void split(State*);
|
|
|
|
void findSCCs();
|
|
void emit(std::ostream&);
|
|
|
|
friend std::ostream& operator<<(std::ostream&, const DFA&);
|
|
friend std::ostream& operator<<(std::ostream&, const DFA*);
|
|
};
|
|
|
|
inline Action::Action(State *s) : state(s) {
|
|
s->action = this;
|
|
}
|
|
|
|
inline bool Action::isRule() const
|
|
{ return false; }
|
|
|
|
inline bool Action::isMatch() const
|
|
{ return false; }
|
|
|
|
inline bool Action::readAhead() const
|
|
{ return !isMatch() || (state && state->next && state->next->action && !state->next->action->isRule()); }
|
|
|
|
inline Match::Match(State *s) : Action(s)
|
|
{ }
|
|
|
|
inline bool Match::isMatch() const
|
|
{ return true; }
|
|
|
|
inline Enter::Enter(State *s, uint l) : Action(s), label(l)
|
|
{ }
|
|
|
|
inline Save::Save(State *s, uint i) : Match(s), selector(i)
|
|
{ }
|
|
|
|
inline bool Save::isMatch() const
|
|
{ return false; }
|
|
|
|
inline bool Rule::isRule() const
|
|
{ return true; }
|
|
|
|
inline std::ostream& operator<<(std::ostream &o, const State *s)
|
|
{ return o << *s; }
|
|
|
|
inline std::ostream& operator<<(std::ostream &o, const DFA *dfa)
|
|
{ return o << *dfa; }
|
|
|
|
#endif
|