| Modifier and Type | Class and Description | 
|---|---|
class  | 
CLawParser
This class implements a parser for causal laws in C. 
 | 
class  | 
CParser
This class implements a parser for an Action Description in C. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
ActionQueryParser
This class implements a parser for action queries in S. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
ABAParser<T extends Formula>  | 
| Modifier and Type | Field and Description | 
|---|---|
private Parser<? extends BeliefBase> | 
ABAParser.formulaparser
Used to parse formulae 
 | 
| Constructor and Description | 
|---|
ABAParser(Parser<? extends BeliefBase> formulaparser)
Create a new ABA parser 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
AspicParser<T extends Invertable>  | 
| Modifier and Type | Field and Description | 
|---|---|
private Parser<? extends BeliefBase> | 
AspicParser.formulaparser
Used to parse formulae 
 | 
| Constructor and Description | 
|---|
AspicParser(Parser<? extends BeliefBase> formulaparser,
           RuleFormulaGenerator<T> rfg)
Constructs a new instance 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
DelpParser
This class implements a parser for defeasible logic programs. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
AbstractDungParser
This abstract class gives a template for parsers of files representing
 abstract argumentation frameworks. 
 | 
class  | 
ApxParser
Parses abstract argumentation frameworks in the logic programming
 format which is given by the following BNF
 (start symbol is S): 
S ::== "" | "arg" "(" ARGUMENT ")" "\n" S | "att" "(" ARGUMENT "," ARGUMENT ")" "\n" S where "ARGUMENT" represents any string (without blanks) as a terminal symbol.  | 
class  | 
CnfParser
Parses abstract argumentation frameworks in the CNF/Dimacs Format used for the
 SAT solver competition (see also http://people.sc.fsu.edu/~jburkardt/data/cnf/cnf.html). 
 | 
class  | 
DungParser
This class implements a parser for dung argumentation theories. 
 | 
class  | 
TgfParser
Parses abstract argumentation frameworks given in the 
 trivial graph format which is given by the following BNF
 (start symbol is S): 
S ::== ARGUMENTS "#" "\n" ATTACKS ARGUMENTS ::== "" | ARGUMENT "\n" ARGUMENTS ATTACKS ::== "" | ATTACK "\n" ATTACKS ATTACK ::== ARGUMENT ARGUMENT where "ARGUMENT" represents any string (without blanks) as a terminal symbol.  | 
| Modifier and Type | Field and Description | 
|---|---|
private Parser<DungTheory> | 
FileDungTheoryGenerator.parser
A parser for parsing the files. 
 | 
| Constructor and Description | 
|---|
FileDungTheoryGenerator(java.io.File[] files,
                       Parser<DungTheory> parser)
Creates a new theory generator for the given files, which
 can be parsed by the given parser. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
ClParser
This class implements a parser for conditional logic. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
FolParser
This class implements a parser for first-order logic. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
PclParser
This class implements a parser for probabilistic conditional logic. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
PlParser
This class implements a parser for propositional logic. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
static Parser<PlBeliefSet> | 
PlParserFactory.getParserForFormat(PlParserFactory.Format f)
Retrieves an appropriate parser for the given format. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
RclParser
This class implements a parser for relational conditional logic. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
RdlParser
This class implements a parser for default logic. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
RpclParser
This class implements a parser for relational probabilistic conditional logic. 
 |