summaryrefslogtreecommitdiffstats
path: root/test/drive_shlexer.cc
blob: fe6f15fc2eb44b5011e5eb5680fc726f69ca4100 (plain)
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
86
87
88
89
90
91
92
93
94
95
96
/**
 * Copyright (c) 2015, Timothy Stack
 *
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 * * Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 * * Neither the name of Timothy Stack nor the names of its contributors
 * may be used to endorse or promote products derived from this software
 * without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <stdlib.h>

#include "config.h"
#include "shlex.hh"

using namespace std;

const char* ST_TOKEN_NAMES[] = {
    "err",
    "wsp",
    "esc",
    "dst",
    "den",
    "sst",
    "sen",
    "ref",
    "qrf",
    "til",
};

int
main(int argc, char* argv[])
{
    if (argc < 2) {
        fprintf(stderr, "error: expecting an argument to parse\n");
        exit(EXIT_FAILURE);
    }

    shlex lexer(argv[1], strlen(argv[1]));
    string_fragment cap;
    shlex_token_t token;

    printf("    %s\n", argv[1]);
    while (lexer.tokenize(cap, token)) {
        int lpc;

        printf("%s ", ST_TOKEN_NAMES[(int) token]);
        for (lpc = 0; lpc < cap.sf_end; lpc++) {
            if (lpc == cap.sf_begin) {
                fputc('^', stdout);
            } else if (lpc == (cap.sf_end - 1)) {
                fputc('^', stdout);
            } else if (lpc > cap.sf_begin) {
                fputc('-', stdout);
            } else {
                fputc(' ', stdout);
            }
        }
        printf("\n");
    }

    lexer.reset();
    std::string result;
    if (lexer.eval(result, map<string, string>())) {
        printf("eval -- %s\n", result.c_str());
    }
    lexer.reset();
    std::vector<std::string> sresult;
    if (lexer.split(sresult, map<string, string>())) {
        printf("split:\n");
        for (size_t lpc = 0; lpc < sresult.size(); lpc++) {
            printf("  %zu -- %s\n", lpc, sresult[lpc].c_str());
        }
    }

    return EXIT_SUCCESS;
}