You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
41 lines
1.1 KiB
C++
41 lines
1.1 KiB
C++
/**
|
|
* Alee Forth: A portable and concise Forth implementation in modern C++.
|
|
* Copyright (C) 2023 Clyne Sullivan <clyne@bitgloo.com>
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef ALEEFORTH_PARSER_HPP
|
|
#define ALEEFORTH_PARSER_HPP
|
|
|
|
#include "types.hpp"
|
|
|
|
#include <string_view>
|
|
|
|
class Parser
|
|
{
|
|
public:
|
|
constexpr static int UnknownWord = -1;
|
|
|
|
int parse(State&, std::string_view&);
|
|
|
|
private:
|
|
int parseSource(State&);
|
|
int parseWord(State&, Word);
|
|
int parseNumber(State&, Word);
|
|
};
|
|
|
|
#endif // ALEEFORTH_PARSER_HPP
|
|
|