mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-15 02:37:55 +00:00
23d333c090
This change includes many bug fixes, for the NT polyfills, strings, memory, boot, and math libraries which were discovered by adding more tools for recreational programming, such as PC emulation. Lemon has also been vendored because it works so well at parsing languages.
81 lines
4.1 KiB
Text
81 lines
4.1 KiB
Text
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ 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; version 2 of the License. │
|
|
│ │
|
|
│ 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, write to the Free Software │
|
|
│ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA │
|
|
│ 02110-1301 USA │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
%include {
|
|
#include "libc/stdio/stdio.h"
|
|
#include "tool/calc/calc.h"
|
|
#include "libc/calls/calls.h"
|
|
#include "libc/str/str.h"
|
|
#include "third_party/dtoa/dtoa.h"
|
|
#include "libc/x/x.h"
|
|
#include "libc/runtime/gc.h"
|
|
#include "libc/math.h"
|
|
}
|
|
|
|
%token_type {struct Token}
|
|
%type number {long double}
|
|
%syntax_error { SyntaxError(); }
|
|
|
|
%left LOR.
|
|
%left LAND.
|
|
%left OR.
|
|
%left XOR.
|
|
%left AND.
|
|
%left EQ NE.
|
|
%left LT LE GT GE.
|
|
%left SHL SHR.
|
|
%left PLUS MINUS.
|
|
%left MUL DIV DDIV REM.
|
|
%right NOT LNOT.
|
|
%right EXP.
|
|
|
|
program ::= number.
|
|
number(A) ::= NUMBER(B). { A = ParseNumber(B); }
|
|
number(A) ::= LP number(B) RP. { A = B; }
|
|
number(A) ::= LNOT number(B). { A = !B; }
|
|
number(A) ::= NOT number(B). { A = ~(long)B; }
|
|
number(A) ::= PLUS number(B). { A = +B; } [NOT]
|
|
number(A) ::= MINUS number(B). { A = -B; } [NOT]
|
|
number(A) ::= SYMBOL(F) LP numbers(N) RP. { A = CallFunction(F, N); }
|
|
number(A) ::= number(B) EQ number(C). { A = B == C; }
|
|
number(A) ::= number(B) NE number(C). { A = B != C; }
|
|
number(A) ::= number(B) LT number(C). { A = B < C; }
|
|
number(A) ::= number(B) LE number(C). { A = B <= C; }
|
|
number(A) ::= number(B) GT number(C). { A = B > C; }
|
|
number(A) ::= number(B) GE number(C). { A = B >= C; }
|
|
number(A) ::= number(B) LOR number(C). { A = B || C; }
|
|
number(A) ::= number(B) LAND number(C). { A = B && C; }
|
|
number(A) ::= number(B) PLUS number(C). { A = B + C; }
|
|
number(A) ::= number(B) MINUS number(C). { A = B - C; }
|
|
number(A) ::= number(B) MUL number(C). { A = B * C; }
|
|
number(A) ::= number(B) DIV number(C). { A = B / C; }
|
|
number(A) ::= number(B) REM number(C). { A = remainderl(B, C); }
|
|
number(A) ::= number(B) EXP number(C). { A = powl(B, C); }
|
|
number(A) ::= number(B) DDIV number(C). { A = truncl(B / C); }
|
|
number(A) ::= number(B) OR number(C). { A = (long)B | (long)C; }
|
|
number(A) ::= number(B) XOR number(C). { A = (long)B ^ (long)C; }
|
|
number(A) ::= number(B) AND number(C). { A = (long)B & (long)C; }
|
|
number(A) ::= number(B) SHL number(C). { A = (long)B << (long)C; }
|
|
number(A) ::= number(B) SHR number(C). { A = (long)B >> (long)C; }
|
|
|
|
%type numbers {struct Numbers *}
|
|
%destructor numbers { NumbersFree($$); }
|
|
numbers(A) ::= . { A = 0; }
|
|
numbers(A) ::= number(B). { A = NumbersAppend(0, B); }
|
|
numbers(A) ::= numbers(A) COMMA number(B). { A = NumbersAppend(A, B); }
|