1 package SQL::Abstract::Tree;
7 # Parser states for _recurse_parse()
8 use constant PARSE_TOP_LEVEL => 0;
9 use constant PARSE_IN_EXPR => 1;
10 use constant PARSE_IN_PARENS => 2;
11 use constant PARSE_RHS => 3;
13 # These SQL keywords always signal end of the current expression (except inside
14 # of a parenthesized subexpression).
15 # Format: A list of strings that will be compiled to extended syntax (ie.
16 # /.../x) regexes, without capturing parentheses. They will be automatically
17 # anchored to word boundaries to match the whole token).
18 my @expression_terminator_sql_keywords = (
23 (?: \b (?: LEFT | RIGHT | FULL ) \s+ )?
24 (?: \b (?: CROSS | INNER | OUTER ) \s+ )?
43 # These are binary operator keywords always a single LHS and RHS
44 # * AND/OR are handled separately as they are N-ary
45 # * so is NOT as being unary
46 # * BETWEEN without paranthesis around the ANDed arguments (which
47 # makes it a non-binary op) is detected and accomodated in
49 my $stuff_around_mathops = qr/[\w\s\`\'\"\)]/;
50 my @binary_op_keywords = (
53 ' ^ ' . quotemeta ($_) . "(?= \$ | $stuff_around_mathops ) ",
54 " (?<= $stuff_around_mathops)" . quotemeta ($_) . "(?= \$ | $stuff_around_mathops ) ",
56 (qw/< > != <> = <= >=/)
59 { '\b (?: NOT \s+)?' . $_ . '\b' }
64 my $tokenizer_re_str = join("\n\t|\n",
65 ( map { '\b' . $_ . '\b' } @expression_terminator_sql_keywords, 'AND', 'OR', 'NOT'),
69 my $tokenizer_re = qr/ \s* ( $tokenizer_re_str | \( | \) | \? ) \s* /xi;
71 sub _binary_op_keywords { @binary_op_keywords }
87 my ($class, $args) = @_;
89 my $profile = delete $args->{profile} || 'none';
90 my $data = {%{$profiles{$profile}}, %{$args||{}}};
98 # tokenize string, and remove all optional whitespace
100 foreach my $token (split $tokenizer_re, $s) {
101 push @$tokens, $token if (length $token) && ($token =~ /\S/);
104 my $tree = $self->_recurse_parse($tokens, PARSE_TOP_LEVEL);
109 my ($self, $tokens, $state) = @_;
112 while (1) { # left-associative parsing
114 my $lookahead = $tokens->[0];
115 if ( not defined($lookahead)
117 ($state == PARSE_IN_PARENS && $lookahead eq ')')
119 ($state == PARSE_IN_EXPR && grep { $lookahead =~ /^ $_ $/xi } ('\)', @expression_terminator_sql_keywords ) )
121 ($state == PARSE_RHS && grep { $lookahead =~ /^ $_ $/xi } ('\)', @expression_terminator_sql_keywords, @binary_op_keywords, 'AND', 'OR', 'NOT' ) )
126 my $token = shift @$tokens;
128 # nested expression in ()
129 if ($token eq '(' ) {
130 my $right = $self->_recurse_parse($tokens, PARSE_IN_PARENS);
131 $token = shift @$tokens or croak "missing closing ')' around block " . $self->unparse($right);
132 $token eq ')' or croak "unexpected token '$token' terminating block " . $self->unparse($right);
134 $left = $left ? [@$left, [PAREN => [$right] ]]
135 : [PAREN => [$right] ];
138 elsif ($token =~ /^ (?: OR | AND ) $/xi ) {
140 my $right = $self->_recurse_parse($tokens, PARSE_IN_EXPR);
142 # Merge chunks if logic matches
143 if (ref $right and $op eq $right->[0]) {
144 $left = [ (shift @$right ), [$left, map { @$_ } @$right] ];
147 $left = [$op => [$left, $right]];
150 # binary operator keywords
151 elsif (grep { $token =~ /^ $_ $/xi } @binary_op_keywords ) {
153 my $right = $self->_recurse_parse($tokens, PARSE_RHS);
155 # A between with a simple LITERAL for a 1st RHS argument needs a
156 # rerun of the search to (hopefully) find the proper AND construct
157 if ($op eq 'BETWEEN' and $right->[0] eq 'LITERAL') {
158 unshift @$tokens, $right->[1][0];
159 $right = $self->_recurse_parse($tokens, PARSE_IN_EXPR);
162 $left = [$op => [$left, $right] ];
164 # expression terminator keywords (as they start a new expression)
165 elsif (grep { $token =~ /^ $_ $/xi } @expression_terminator_sql_keywords ) {
167 my $right = $self->_recurse_parse($tokens, PARSE_IN_EXPR);
168 $left = $left ? [ $left, [$op => [$right] ]]
169 : [ $op => [$right] ];
171 # NOT (last as to allow all other NOT X pieces first)
172 elsif ( $token =~ /^ not $/ix ) {
174 my $right = $self->_recurse_parse ($tokens, PARSE_RHS);
175 $left = $left ? [ @$left, [$op => [$right] ]]
176 : [ $op => [$right] ];
179 # literal (eat everything on the right until RHS termination)
181 my $right = $self->_recurse_parse ($tokens, PARSE_RHS);
182 $left = $left ? [ $left, [LITERAL => [join ' ', $token, $self->unparse($right)||()] ] ]
183 : [ LITERAL => [join ' ', $token, $self->unparse($right)||()] ];
188 use Term::ANSIColor 'color';
190 my %ghetto_colormap = (
191 select => [color('red'), color('reset')],
192 where => [color('green'), color('reset')],
193 from => [color('cyan'), color('reset')],
197 my ($self, $keyword) = @_;
199 if (my $around = $ghetto_colormap{lc $keyword}) {
200 $keyword = "$around->[0]$keyword$around->[1]";
207 my %ghetto_whitespacemap = (
214 my ($self, $keyword, $depth) = @_;
218 if (defined $ghetto_whitespacemap{lc $keyword}) {
219 $before = $self->newline . $self->indent($depth + $ghetto_whitespacemap{lc $keyword});
221 $before = '' if $depth == 0 and lc $keyword eq 'select';
222 return [$before, $after];
225 sub _newline { $_[0]->{newline} }
226 sub _indent { $_[0]->{indent} }
227 sub _indent_amount { $_[0]->{indent_amount} }
228 sub newline { $_[0]->_newline }
230 sub indent { $_[0]->_indent x $_[0]->_indent_amount x $_[1] }
234 $tree = $tree->[0] while ref $tree;
236 defined $tree && lc $tree eq 'select';
240 my ($self, $tree, $depth) = @_;
248 my $car = $tree->[0];
249 my $cdr = $tree->[1];
252 return join ('', map $self->unparse($_, $depth), @$tree);
254 elsif ($car eq 'LITERAL') {
257 elsif ($car eq 'PAREN') {
260 map $self->unparse($_, $depth + 2), @{$cdr}) .
261 (_is_select($cdr)?$self->newline.$self->indent($depth + 1):'') . ')';
263 elsif ($car eq 'OR' or $car eq 'AND' or (grep { $car =~ /^ $_ $/xi } @binary_op_keywords ) ) {
264 return join (" $car ", map $self->unparse($_, $depth), @{$cdr});
267 my ($l, $r) = @{$self->whitespace($car, $depth)};
268 return sprintf "$l%s %s$r", $self->format_keyword($car), $self->unparse($cdr, $depth);
272 sub format { my $self = shift; $self->unparse($self->parse(@_)) }