arrow-parser 0.0.2

Parser for the Arrow programming language
Documentation 
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

use crate::operator::Arity::*;
use crate::operator::Associativity::*;
use crate::operator::ExprOperatorName::*;
use lazy_static::lazy_static;
use std::collections::HashMap;

#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug)]
pub enum AssignOperator {
  Default,
  Addition,
  BitwiseAnd,
  BitwiseLeftShift,
  BitwiseOr,
  BitwiseRightShift,
  BitwiseUnsignedRightShift,
  BitwiseXor,
  Division,
  Exponentiation,
  Index,
  LogicalAnd,
  LogicalOr,
  Multiplication,
  Remainder,
  Subtraction,
}

#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug)]
pub enum ExprOperatorName {
  Addition,
  Arrow,
  As,
  Bind,
  BitwiseAnd,
  BitwiseLeftShift,
  BitwiseOr,
  BitwiseRightShift,
  BitwiseUnsignedRightShift,
  BitwiseXor,
  Call,
  Division,
  Equality,
  Exponentiation,
  GreaterThan,
  GreaterThanOrEqual,
  Index,
  Inequality,
  LessThan,
  LessThanOrEqual,
  LogicalAnd,
  LogicalOr,
  MemberAccess,
  Multiplication,
  Negation,
  Not,
  OptionalCall,
  OptionalCoalescing,
  OptionalIndex,
  OptionalMemberAccess,
  Remainder,
  Subtraction,
}

#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug)]
pub enum Arity {
  Unary,
  Binary,
}

#[derive(Copy, Clone, Eq, PartialEq, Hash, Debug)]
pub enum Associativity {
  Left,
  Right,
}

pub struct ExprOperator {
  pub name: ExprOperatorName,
  pub arity: Arity,
  pub associativity: Associativity,
  pub precedence: u8,
}

const PRECEDENCE_LEVELS: &'static [&'static [(ExprOperatorName, Arity, Associativity)]] = &[
  &[
    (Bind, Binary, Left),
    (MemberAccess, Binary, Left),
    (Index, Binary, Left),
    (Call, Binary, Left),
    (OptionalMemberAccess, Binary, Left),
    (OptionalIndex, Binary, Left),
    (OptionalCall, Binary, Left),
  ],
  &[(Not, Unary, Right), (Negation, Unary, Right)],
  &[(As, Binary, Left)],
  &[(Exponentiation, Binary, Right)],
  &[
    (Multiplication, Binary, Left),
    (Division, Binary, Left),
    (Remainder, Binary, Left),
  ],
  &[(Addition, Binary, Left), (Subtraction, Binary, Left)],
  &[
    (BitwiseLeftShift, Binary, Left),
    (BitwiseRightShift, Binary, Left),
    (BitwiseUnsignedRightShift, Binary, Left),
  ],
  &[
    (LessThan, Binary, Left),
    (LessThanOrEqual, Binary, Left),
    (GreaterThan, Binary, Left),
    (GreaterThanOrEqual, Binary, Left),
  ],
  &[(Equality, Binary, Left), (Inequality, Binary, Left)],
  &[(BitwiseAnd, Binary, Left)],
  &[(BitwiseXor, Binary, Left)],
  &[(BitwiseOr, Binary, Left)],
  &[(LogicalAnd, Binary, Left)],
  &[
    (LogicalOr, Binary, Left),
    (OptionalCoalescing, Binary, Left),
  ],
  &[(Arrow, Binary, Left)],
];

lazy_static! {
  pub static ref EXPR_OPERATORS: HashMap<ExprOperatorName, ExprOperator> = {
    let mut map = HashMap::<ExprOperatorName, ExprOperator>::new();
    for (i, ops) in PRECEDENCE_LEVELS.iter().enumerate() {
      let precedence = (PRECEDENCE_LEVELS.len() - i) as u8;
      for &(name, arity, associativity) in ops.iter() {
        map.insert(name, ExprOperator {
          name,
          arity,
          associativity,
          precedence,
        });
      }
    }
    map
  };
}