| Package | Description |
|---|---|
| me.jaimegarza.syntax | |
| me.jaimegarza.syntax.generator | |
| me.jaimegarza.syntax.language |
| Modifier and Type | Method and Description |
|---|---|
boolean |
EmbeddedCodeProcessor.generateConstant(Lexer lexer,
char characterType)
Scan the stream unti a string that starts with the given character ends
|
boolean |
EmbeddedCodeProcessor.generateDollarDollar(Lexer lexer,
int elementCount,
String nonTerminalId,
Type type)
$$ detected.
|
boolean |
EmbeddedCodeProcessor.generateDollarLetter(Lexer lexer,
int elementCount,
Type type,
String nonTerminalId)
$Letter was detected.
|
boolean |
EmbeddedCodeProcessor.generateDollarNumber(Lexer lexer,
int elementCount,
Type type,
int sign)
$1, $2, $-3, etc detected.
|
Type |
EmbeddedCodeProcessor.getTypeFromStream(Lexer lexer)
Retrieve the type embedded as in $<type>1
|
boolean |
EmbeddedCodeProcessor.skipAndOutputCompositeComment(Lexer lexer,
char secondaryCharacter,
char primaryCharacter)
Skip a comment, and copying it to the output
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractCodeParser
This class contains the "non-parser" code, or supporting code for the syntax
parser.
|
class |
SyntaxCodeParser
Parser for a grammar.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
AbstractCodeParser.generateConstant(Lexer lexer,
char characterType) |
boolean |
AbstractCodeParser.generateDollarDollar(Lexer lexer,
int elementCount,
String nonTerminalId,
Type type)
$$ detected.
|
boolean |
AbstractCodeParser.generateDollarLetter(Lexer lexer,
int elementCount,
Type type,
String nonTerminalId)
$Letter was detected.
|
boolean |
AbstractCodeParser.generateDollarNumber(Lexer lexer,
int elementCount,
Type type,
int sign)
$1, $2, $-3, etc detected.
|
Type |
AbstractCodeParser.getTypeFromStream(Lexer lexer)
EMBEDDED CODE PROCESSOR
|
boolean |
AbstractCodeParser.skipAndOutputCompositeComment(Lexer lexer,
char secondaryCharacter,
char characterToFind) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
Pascal.generateLexerCode(FormattingPrintStream output,
String lexerMode,
Lexer lexer,
Terminal token,
int additionalIndent) |
boolean |
LanguageSupport.generateLexerCode(FormattingPrintStream output,
String lexerMode,
Lexer lexer,
Terminal token,
int additionalIndent)
Emit the code for the lexical part of the grammar
|
boolean |
BaseLanguageSupport.generateLexerCode(FormattingPrintStream output,
String lexerMode,
Lexer lexer,
Terminal token,
int additionalIndent) |
boolean |
Pascal.generateRuleCode(Lexer lexer,
EmbeddedCodeProcessor processor,
int elementCount,
String nonTerminalId,
int sourceColumn) |
boolean |
LanguageSupport.generateRuleCode(Lexer lexer,
EmbeddedCodeProcessor processor,
int elementCount,
String nonTerminalId,
int sourceColumn)
Parsing logic
Scan the input stream until a rule set of actions end.
|
boolean |
BaseLanguageSupport.generateRuleCode(Lexer lexer,
EmbeddedCodeProcessor processor,
int elementCount,
String nonTerminalId,
int sourceColumn) |
boolean |
Pascal.generateStructure(Lexer lexer) |
boolean |
LanguageSupport.generateStructure(Lexer lexer)
For yacc compatibility this is called the union, but it is
really a structure
|
boolean |
Javascript.generateStructure(Lexer lexer) |
boolean |
Java.generateStructure(Lexer lexer) |
boolean |
C.generateStructure(Lexer lexer) |
protected boolean |
BaseLanguageSupport.lexerComment(FormattingPrintStream output,
Lexer lexer,
char characterToFind) |
protected boolean |
Pascal.lexerDollar(FormattingPrintStream output,
String lexerMode,
Lexer lexer,
Terminal token) |
protected boolean |
BaseLanguageSupport.lexerDollar(FormattingPrintStream output,
String lexerMode,
Lexer lexer,
Terminal token) |
protected void |
Pascal.lexerReturnValue(FormattingPrintStream output,
String lexerMode,
Lexer lexer) |
protected boolean |
BaseLanguageSupport.lexerString(FormattingPrintStream output,
Lexer lexer,
char characterToFind) |
protected int |
BaseLanguageSupport.manageDollar(Lexer lexer,
EmbeddedCodeProcessor processor,
int elementCount,
String nonTerminalId) |
Copyright © 2017. All rights reserved.