|
Abstract family of acceptors
|
309 |
3 |
37 |
6 |
1.7 |
|
Abstract rewriting system
|
51 |
14 |
28 |
18 |
3.5 |
|
Adaptive grammar
|
144 |
22 |
23 |
3 |
2.2 |
|
Augmented Backus–Naur Form
|
166 |
13 |
10 |
5 |
2.5 |
|
Backus–Naur Form
|
59 |
4 |
37 |
10 |
2.9 |
|
Context-free grammar
|
143 |
7 |
30 |
2 |
2.9 |
|
Diff
|
47 |
22 |
14 |
2 |
3.2 |
|
Extended Backus–Naur Form
|
144 |
15 |
19 |
3 |
1.3 |
|
Finite state transducer
|
221 |
30 |
13 |
4 |
1.2 |
|
Formal grammar
|
222 |
2 |
16 |
3 |
1.6 |
|
Formal language
|
66 |
4 |
11 |
3 |
3.3 |
|
History monoid
|
149 |
26 |
59 |
17 |
2.6 |
|
Interpretation (logic)
|
276 |
24 |
22 |
7 |
1.6 |
|
Junction Grammar
|
31 |
5 |
9 |
4 |
1.9 |
|
Left recursion
|
55 |
13 |
8 |
2 |
1.5 |
|
Nested word
|
58 |
11 |
20 |
4 |
3.5 |
|
Parser combinator
|
380 |
19 |
39 |
7 |
3.5 |
|
Parsing expression grammar
|
92 |
3 |
12 |
2 |
1.3 |
|
Pumping lemma for context-free languages
|
95 |
5 |
16 |
4 |
1.5 |
|
Regular expression
|
139 |
5 |
14 |
3 |
1.8 |
|
