| 
|   | PgfParser (const Pgf &p) | 
|   | 
|   | PgfParser (const QString &fileName, const QString &concreteName=QString()) | 
|   | 
| virtual  | ~PgfParser () | 
|   | 
| void  | setInputStdin () | 
|   | 
| void  | setInputFile (const QString &fileName) | 
|   | 
| void  | setInputBytes (const QByteArray &bytes) | 
|   | 
| void  | setInputString (const QString &string) | 
|   | 
| void  | setInputBuffer (QByteArray *buffer) | 
|   | 
| QString  | catName (int cat) const | 
|   | 
| QString  | functionName (int id) const | 
|   | 
| void  | filterCoercionsFromSyntaxTree (Node &tree) const | 
|   | 
|   | Parser (TokenSource *tokenSource) | 
|   | 
| virtual  | ~Parser () | 
|   | 
| bool  | isToken (CatArg cat) const | 
|   | 
| void  | addToken (CatArg cat) | 
|   | 
| bool  | isLiteral (const QList< Cat > &list) const | 
|   | is a given list of categories a literal?  More...
  | 
|   | 
| void  | initCaches () | 
|   | clears all caches, then computes the nullable categories and the initial graph  More...
  | 
|   | 
| void  | addRule (CatArg cat, const Rule &rule) | 
|   | adds a new rule to the grammar, updates the nullable categories and the initial graph and clears the other caches  More...
  | 
|   | 
| void  | loadCfg (const Cfg &cfg) | 
|   | 
| Cfg  | getCfg () | 
|   | get a Cfg object back from the parser, for serialization  More...
  | 
|   | 
| bool  | loadPmcfg (const Pmcfg &pmcfg) | 
|   | loads a PMCFG in standard form, converting it to the internal representation  More...
  | 
|   | 
| bool  | addPmcfgRule (Pmcfg &pmcfg, CatArg cat, const Rule &rule) | 
|   | adds a new rule to the grammar (both the PMCFG and the internal representation), updates the nullable categories and the initial graph and clears the other caches  More...
  | 
|   | 
| QList< Match >  | parse (int *errorPos=0, Cat *errorToken=0, int *incrementalPos=0, QList< StackItem > *incrementalStacks=0, QList< Match > *incrementalMatches=0, LexerState *lexerState=0) | 
|   | parse the input string  More...
  | 
|   | 
| QList< Match >  | parse (ParseState *parseState) | 
|   | overloaded version using ParseState, for bindings  More...
  | 
|   | 
| void  | saveState (ParseState *parseState) | 
|   | saves the current parser state, only meaningful during a parse operation  More...
  | 
|   | 
| Predictions  | computePredictions (const QList< StackItem > &stacks) const | 
|   | compute a set of predictions from the stacks produced by an incremental parse  More...
  | 
|   | 
| Predictions  | computePredictions (const ParseState &parseState) const | 
|   | overloaded version using ParseState, for bindings  More...
  | 
|   | 
| QHash< Cat, QSet< Cat > >  | expandNonterminalPrediction (CatArg cat) const | 
|   | expand a nonterminal prediction to the possible initial tokens and the nonterminals they immediately reduce to (for categorization), using recursive descent  More...
  | 
|   | 
| QHash< Cat, QSet< Cat > >  | expandNonterminalPredictionC (CatArg cat) | 
|   | expand a nonterminal prediction to the possible initial tokens and the nonterminals they immediately reduce to (for categorization), using recursive descent  More...
  | 
|   | 
| MultiPredictions  | computeMultiPredictions (const QList< StackItem > &stacks) const | 
|   | compute a set of multi-token predictions from the stacks produced by an incremental parse  More...
  | 
|   | 
| MultiPredictions  | computeMultiPredictions (const ParseState &parseState) const | 
|   | overloaded version using ParseState, for bindings  More...
  | 
|   | 
| QHash< Cat, QSet< QList< Cat > > >  | expandNonterminalPredictionMulti (CatArg cat) const | 
|   | expand a nonterminal prediction to the possible initial nonempty literals (strings of one or more tokens) and the nonterminals they immediately reduce to (for categorization), using recursive descent  More...
  | 
|   | 
| QHash< Cat, QSet< QList< Cat > > >  | expandNonterminalPredictionMultiC (CatArg cat) | 
|   | expand a nonterminal prediction to the possible initial nonempty literals (strings of one or more tokens) and the nonterminals they immediately reduce to (for categorization), using recursive descent  More...
  | 
|   | 
| ConstrainedPredictions  | computeConstrainedPredictions (const QList< StackItem > &stacks) const | 
|   | compute a set of predictions from the stacks produced by an incremental parse  More...
  | 
|   | 
| ConstrainedPredictions  | computeConstrainedPredictions (const ParseState &parseState) const | 
|   | overloaded version using ParseState, for bindings  More...
  | 
|   | 
| QHash< Cat, QSet< Cat > >  | expandNonterminalPredictionC (CatArg cat, const NextTokenConstraints &nextTokenConstraints) | 
|   | expand a nonterminal prediction to the possible initial tokens and the nonterminals they immediately reduce to (for categorization), using recursive descent  More...
  | 
|   | 
| QHash< Cat, QSet< Cat > >  | expandNonterminalPredictionC (CatArg cat, const QList< NextTokenConstraints > &nextTokenConstraintsList) | 
|   | expand a nonterminal prediction to the possible initial tokens and the nonterminals they immediately reduce to (for categorization), using recursive descent  More...
  | 
|   | 
| ConstrainedMultiPredictions  | computeConstrainedMultiPredictions (const QList< StackItem > &stacks) const | 
|   | compute a set of multi-token predictions from the stacks produced by an incremental parse  More...
  | 
|   | 
| ConstrainedMultiPredictions  | computeConstrainedMultiPredictions (const ParseState &parseState) const | 
|   | overloaded version using ParseState, for bindings  More...
  | 
|   | 
| QHash< Cat, QSet< QList< Cat > > >  | expandNonterminalPredictionMultiC (CatArg cat, const NextTokenConstraints &nextTokenConstraints) | 
|   | expand a nonterminal prediction to the possible initial nonempty literals (strings of one or more tokens) and the nonterminals they immediately reduce to (for categorization), using recursive descent  More...
  | 
|   | 
| QHash< Cat, QSet< QList< Cat > > >  | expandNonterminalPredictionMultiC (CatArg cat, const QList< NextTokenConstraints > &nextTokenConstraintsList) | 
|   | expand a nonterminal prediction to the possible initial nonempty literals (strings of one or more tokens) and the nonterminals they immediately reduce to (for categorization), using recursive descent  More...
  | 
|   | 
parser for PGF grammars 
Definition at line 70 of file pgf.h.