summaryrefslogtreecommitdiff
path: root/src/sexpr/parser.hpp
blob: feed636a4ad94081ad5ce32ef1428ee26186dce2 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#pragma once
//    parser.hpp - build a tree of S-expressions
//
//    Copyright © 2014 Ben Longbons <b.r.longbons@gmail.com>
//
//    This file is part of The Mana World (Athena server)
//
//    This program is free software: you can redistribute it and/or modify
//    it under the terms of the GNU Affero General Public License as published by
//    the Free Software Foundation, either version 3 of the License, or
//    (at your option) any later version.
//
//    This program is distributed in the hope that it will be useful,
//    but WITHOUT ANY WARRANTY; without even the implied warranty of
//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//    GNU Affero General Public License for more details.
//
//    You should have received a copy of the GNU Affero General Public License
//    along with this program.  If not, see <http://www.gnu.org/licenses/>.

#include "fwd.hpp"

#include <cstdlib>

#include "../strings/fwd.hpp"

#include "../io/line.hpp"

#include "lexer.hpp"

#include "fwd.hpp"


namespace tmwa
{
namespace sexpr
{
    enum Type
    {
        LIST,
        INT,
        STRING,
        TOKEN,
    };

    struct SExpr
    {
        Type _type;
        int64_t _int;
        RString _str;
        std::vector<SExpr> _list;

        io::LineSpan _span;

        SExpr() : _type(), _int(), _str(), _list(), _span() {}
    };

    inline
    bool operator == (const SExpr& l, const SExpr& r)
    {
        if (l._type != r._type)
            return false;
        switch (l._type)
        {
        case LIST:
            return l._list == r._list;
        case INT:
            return l._int == r._int;
        case STRING:
        case TOKEN:
            return l._str == r._str;
        }
        abort();
    }
    inline
    bool operator != (const SExpr& l, const SExpr& r)
    {
        return !(l == r);
    }

    bool token_is_int(ZString s, int64_t& out, bool& ok);
    /// return false on error or eof, check lex.peek() == TOK_EOF to see
    bool parse(Lexer& lex, SExpr& out);
} // namespace sexpr
} // namespace tmwa