|
| 1 | +package week6.kalaparser; |
| 2 | + |
| 3 | +import week5.kalalexer.KalaLexer; |
| 4 | +import week5.kalalexer.KalaToken; |
| 5 | + |
| 6 | +import java.util.ArrayList; |
| 7 | +import java.util.List; |
| 8 | + |
| 9 | +import static week5.kalalexer.KalaToken.Type.*; |
| 10 | + |
| 11 | +public class KalaParser { |
| 12 | + |
| 13 | + private final List<KalaToken> tokens; |
| 14 | + private int pos; |
| 15 | + |
| 16 | + private KalaParser(KalaLexer lexer) { |
| 17 | + this.tokens = lexer.readAllTokens(); |
| 18 | + this.pos = 0; |
| 19 | + } |
| 20 | + |
| 21 | + public static KalaNode parse(String input) { |
| 22 | + KalaLexer lexer = new KalaLexer(input); |
| 23 | + // Ja kuidagi võiks nüüd seda lekserit kasutada oma parseris... |
| 24 | + KalaParser parser = new KalaParser(lexer); |
| 25 | + return parser.parse(); |
| 26 | + } |
| 27 | + |
| 28 | + private KalaNode parse() { |
| 29 | + KalaNode node = s(); |
| 30 | + done(); |
| 31 | + return node; |
| 32 | + } |
| 33 | + |
| 34 | + private void done() { |
| 35 | + if (peek().type() != EOF) throw new KalaParseException(peek(), EOF); |
| 36 | + } |
| 37 | + |
| 38 | + private KalaToken peek() { |
| 39 | + return tokens.get(pos); |
| 40 | + } |
| 41 | + |
| 42 | + private void match(KalaToken.Type tokenType) { |
| 43 | + if (peek().type() != tokenType) { |
| 44 | + throw new KalaParseException(peek(), tokenType); |
| 45 | + } |
| 46 | + pos++; |
| 47 | + } |
| 48 | + |
| 49 | + |
| 50 | + // S → (L) | () |
| 51 | + // L → A,L | A |
| 52 | + // A → w | 0 | S |
| 53 | + private KalaNode s() { |
| 54 | + match(LPAREN); |
| 55 | + if (peek().type() == RPAREN) { |
| 56 | + match(RPAREN); |
| 57 | + return KalaNode.mkList(); |
| 58 | + } else { |
| 59 | + List<KalaNode> list = l(); |
| 60 | + match(RPAREN); |
| 61 | + return KalaNode.mkList(list); |
| 62 | + } |
| 63 | + } |
| 64 | + |
| 65 | + private List<KalaNode> l() { |
| 66 | + List<KalaNode> list = new ArrayList<>(); |
| 67 | + list.add(a()); |
| 68 | + if (peek().type() == COMMA) { |
| 69 | + match(COMMA); |
| 70 | + list.addAll(l()); |
| 71 | + return list; |
| 72 | + } |
| 73 | + return list; |
| 74 | + } |
| 75 | + |
| 76 | + // Alternatiivse variandina võib seda iteratiivselt teha. |
| 77 | + // L → A,L | A esitame EBNF kujul L → A(,A)* |
| 78 | + private List<KalaNode> l_ebnf() { |
| 79 | + List<KalaNode> list = new ArrayList<>(); |
| 80 | + list.add(a()); |
| 81 | + while (peek().type() == COMMA) { |
| 82 | + match(COMMA); |
| 83 | + list.add(a()); |
| 84 | + } |
| 85 | + return list; |
| 86 | + } |
| 87 | + |
| 88 | + private KalaNode a() { |
| 89 | + KalaToken node = peek(); |
| 90 | + switch (node.type()) { |
| 91 | + case IDENT: |
| 92 | + match(IDENT); |
| 93 | + return KalaNode.mkIdent((String) node.data()); |
| 94 | + case NULL: |
| 95 | + match(NULL); |
| 96 | + return KalaNode.mkNull(); |
| 97 | + case LPAREN: |
| 98 | + return s(); |
| 99 | + default: |
| 100 | + throw new KalaParseException(peek(), IDENT, NULL, LPAREN); |
| 101 | + } |
| 102 | + } |
| 103 | + |
| 104 | + static void main() { |
| 105 | + KalaNode ast = parse("(kala, (x,y , null, (), (kala,()) ))"); |
| 106 | + System.out.println(ast); |
| 107 | + } |
| 108 | +} |
0 commit comments