gallop - General LL(1) Parser
See the documentation for the tutorial.
let mut grammar: Grammar = BTreeMap::new();
grammar.insert("START", vec![
vec![RuleElement::NonTerminal("a+")],
]);
grammar.insert("a+", vec![
vec![RuleElement::Terminal('a'), RuleElement::NonTerminal("a*")],
]);
grammar.insert("a*", vec![
vec![RuleElement::Terminal('a'), RuleElement::NonTerminal("a*")],
vec![RuleElement::Empty],
]);
let mut parser = Parser::new(&mut grammar).unwrap();
assert!(parser.parse("aaa").unwrap() == ParseTree::NonTerminal {
symbol: "START",
children: vec![ParseTree::Terminal('a'), ParseTree::Terminal('a'), ParseTree::Terminal('a')],
});
Please report any bugs or feature requests at:
Feel free to fork the repository and submit pull requests :)
- Compiler Design in C by Holub
- Compilers Principles, Techniques and Tools by Aho et al.
- Parsing Techniques - A Practicle Guide by Grune & Jacobs
IT COMES WITHOUT WARRANTY OF ANY KIND.
Copyright (C) 2021 by Alfie John
This program is free software: you can redistribute it and/or modify it under the terms of the GNU 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 General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see https://www.gnu.org/licenses/.