diff options
| author | bjculkin <bjculkin@mix.wvu.edu> | 2018-02-15 15:25:09 -0500 |
|---|---|---|
| committer | bjculkin <bjculkin@mix.wvu.edu> | 2018-02-15 15:25:09 -0500 |
| commit | 5028ad9a1faad0e363d017f18363e8062ba59871 (patch) | |
| tree | 80df30dc24a2cd79abf7533b98fcfcd28b1f4fee /JPratt/src/main/java/bjc/pratt/blocks/ChainParseBlock.java | |
| parent | 1112bb1b44bb3aabe439a2b9f88a51a9c1e435de (diff) | |
Formatting and things
Diffstat (limited to 'JPratt/src/main/java/bjc/pratt/blocks/ChainParseBlock.java')
| -rw-r--r-- | JPratt/src/main/java/bjc/pratt/blocks/ChainParseBlock.java | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/JPratt/src/main/java/bjc/pratt/blocks/ChainParseBlock.java b/JPratt/src/main/java/bjc/pratt/blocks/ChainParseBlock.java index 5c728d9..c7710dc 100644 --- a/JPratt/src/main/java/bjc/pratt/blocks/ChainParseBlock.java +++ b/JPratt/src/main/java/bjc/pratt/blocks/ChainParseBlock.java @@ -16,13 +16,13 @@ import bjc.utils.parserutils.ParserException; * @author bjculkin * * @param <K> - * The token key type. + * The token key type. * * @param <V> - * The token value type. + * The token value type. * * @param <C> - * The parser state type. + * The parser state type. * */ public class ChainParseBlock<K, V, C> implements ParseBlock<K, V, C> { @@ -36,13 +36,13 @@ public class ChainParseBlock<K, V, C> implements ParseBlock<K, V, C> { * Create a new chain parser block. * * @param inner - * The block for the chains interior. + * The block for the chains interior. * * @param chainIndicators - * The set of markers that indicate continuing the chain + * The set of markers that indicate continuing the chain * * @param term - * The node in the AST for the expression. + * The node in the AST for the expression. */ public ChainParseBlock(ParseBlock<K, V, C> inner, Set<K> chainIndicators, Token<K, V> term) { iner = inner; @@ -55,11 +55,11 @@ public class ChainParseBlock<K, V, C> implements ParseBlock<K, V, C> { ITree<Token<K, V>> expression = iner.parse(ctx); Token<K, V> currentToken = ctx.tokens.current(); - if (indicators.contains(currentToken.getKey())) { + if(indicators.contains(currentToken.getKey())) { ITree<Token<K, V>> res = new Tree<>(trm); res.addChild(expression); - while (indicators.contains(currentToken.getKey())) { + while(indicators.contains(currentToken.getKey())) { res.addChild(new Tree<>(currentToken)); ctx.tokens.next(); |
