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
97
98
99
100
101
102
103
104
105
106
107
108
109
110

/*
	Authour: Christopher Diggins
	License: MIT Licence 1.0
	
	YARD Grammar for the Heron language
*/

#ifndef HERON_GRAMMAR_HPP
#define HERON_GRAMMAR_HPP

namespace heron_grammar
{
	using namespace jaction_grammar;

	struct CLASS		: Keyword<CharSeq<'c','l','a','s','s'> > { };
	struct CLASSES		: Keyword<CharSeq<'c','l','a','s','s','e','s'> > { };
	struct DOMAIN		: Keyword<CharSeq<'d','o','m','a','i','n'> > { };
	struct IMPORTS		: Keyword<CharSeq<'i','m','p','o','r','t','s'> > { };
	struct LINKS		: Keyword<CharSeq<'l','i','n','k','s'> > { };
	struct SUBCLASSES   : Keyword<CharSeq<'s','u','b','c','l','a','s','s','e','s'> > { };
	struct STATES		: Keyword<CharSeq<'s','t','a','t','e','s'> > { };
	struct ATTRIBUTES	: Keyword<CharSeq<'a','t','t','r','i','b','u','t','e','s'> > { };
	struct OPERATIONS	: Keyword<CharSeq<'o','p','e','r','a','t','i','o','n','s'> > { };
	struct TRANSITIONS	: Keyword<CharSeq<'t','r','a','n','s','i','t','i','o','n','s'> > { };
	struct INVARIANTS	: Keyword<CharSeq<'i','n','v','a','r','i','a','n','t','s'> > { };
	struct ENTRY		: Keyword<CharSeq<'e','n','t','r','y'> > { };
	struct ARROW		: Keyword<CharSeq<'-','>'> > { };
	
	struct Eos : CharTok<';'> { };

	struct EntryProc :
		NoFailSeq<ENTRY, Store<CodeBlock> > { };

	struct Transition : 
		NoFailSeq<Store<Sym>, ARROW, Store<Sym>, Eos > { };
		
	struct TransitionTable : 
		NoFailSeq<TRANSITIONS, StoreBracedList<Transition> > { };

	struct State :
		NoFailSeq<Store<Sym>, CharTok<'('>, Opt<Store<Arg> >, CharTok<')'>, CharTok<'{'>, Opt<EntryProc>, Store<TransitionTable>, CharTok<'}'> > { };

	struct Attribute :
		NoFailSeq<Store<Sym>, Opt<TypeDecl>, Eos >  { };

	struct Attributes :
		NoFailSeq<ATTRIBUTES, StoreBracedList<Attribute> > { };
	
	struct Link :
		NoFailSeq<Store<Sym>, TypeDecl, Eos > { };

	struct Links : 
		NoFailSeq<LINKS, StoreBracedList<Link> > { };
	
	struct Operation :
		NoFailSeq<Store<Sym>, Store<ArgList>, Opt<TypeDecl>, Or<Store<CodeBlock>, Eos> > { };

	struct Operations :
		NoFailSeq<OPERATIONS, StoreBracedList<Operation> > { };

	struct States :
		NoFailSeq<STATES, StoreBracedList<State> > { };		

	struct Invariant : 
		NoFailSeq<Store<Sym>, Store<CodeBlock> > { };

	struct Invariants :
		NoFailSeq<INVARIANTS, StoreBracedList<Invariant> > { };

	struct Subclass : 
		NoFailSeq<Store<Sym>, Eos> 
	{ };

	struct Subclasses : 
		NoFailSeq<SUBCLASSES, StoreBracedList<Subclass> > { };

	struct Class :
		NoFailSeq<
			CLASS, 
			Store<Sym>, 
			CharTok<'{'>, 
			// NOTE: I can't decide whether I think each section should be a child or not.
			// I think that probably this approach used for "subclasses" should be applied to each other 
			// section
			Opt<Store<Subclasses> >,
			Opt<Attributes>, 
			Opt<Operations>, 
			Opt<States>, 
			Opt<Links>, 
			Opt<Invariants>, 
			CharTok<'}'> 
		> { };

	struct Import :
		NoFailSeq<Store<Sym>, Eos > { };

	struct Imports :
		NoFailSeq<IMPORTS, StoreBracedList<Import> > { };

	struct Classes :
		NoFailSeq<CLASSES, StoreBracedList<Class> > { };

	struct Domain :
		NoFailSeq<DOMAIN, Store<Sym>, CharTok<'{'>, Opt<Imports>, Opt<Attributes>, Opt<Operations>, Opt<Classes>, CharTok<'}'> > { };

	struct Program :
		Seq<WS, Star<Store<Domain> > > { };
}	

#endif