File: const_gram.y

package info (click to toggle)
pcb-rnd 3.1.7b-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 33,108 kB
  • sloc: ansic: 213,400; yacc: 6,241; sh: 4,698; awk: 3,016; makefile: 2,254; lex: 1,166; python: 519; xml: 261; lisp: 154; tcl: 67; perl: 34; javascript: 6; ruby: 5
file content (199 lines) | stat: -rw-r--r-- 5,050 bytes parent folder | download | duplicates (3)
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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
%prefix pcb_ordc_%

%struct
{
	long line, first_col, last_col;
}

%union
{
	double d;
	int i;
	char *s;
	pcb_ordc_node_t *tree;
}


%{
/*
 *                            COPYRIGHT
 *
 *  pcb-rnd, interactive printed circuit board design
 *
 *  order plugin - constraint language grammar
 *  pcb-rnd Copyright (C) 2020 Tibor 'Igor2' Palinkas
 *
 *  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; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  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.
 *
 *  Contact:
 *    Project page: http://repo.hu/projects/pcb-rnd
 *    lead developer: http://repo.hu/projects/pcb-rnd/contact.html
 *    mailing list: pcb-rnd (at) list.repo.hu (send "subscribe")
 */
#include "../src_plugins/order/const_gram.h"
#include "../src_plugins/order/constraint.h"


%}

/* Constants */
%token T_CINT T_CFLOAT T_STRING T_QSTR T_ID

/* Operators */
%token T_EQ T_NEQ T_GE T_LE T_GT T_LT T_AND T_OR T_NOT

/* Keywords for builtin functions */
%token T_IF T_ERROR T_INT T_FLOAT T_STR


%left T_EQ T_NEQ T_GE T_LE T_GT T_LT
%left T_OR
%left T_AND
%left '+' '-'
%left '*' '/' '%'
%left T_NOT
%right '(' ')'

%type <s> T_QSTR
%type <s> T_ID
%type <i> T_CINT
%type <d> T_CFLOAT

%type <tree> expr
%type <tree> stmt_if
%type <tree> stmt_error
%type <tree> stmt_block
%type <tree> statement
%type <tree> statements

%%

file:
		statements        { ctx->root->ch_first = $1; }
	;

statement:
	  stmt_if           { $$ = $1; }
	| stmt_error        { $$ = $1; }
	| stmt_block        { $$ = $1; }
	;

/*** expressions ***/
expr:
	  '-' expr              { $$ = unop(PCB_ORDC_NEG, $2); }
	| T_NOT expr            { $$ = unop(PCB_ORDC_NOT, $2); }
	| '(' expr ')'          { $$ = $2; }
	| expr T_EQ expr        { $$ = binop(PCB_ORDC_EQ, $1, $3); }
	| expr T_NEQ expr       { $$ = binop(PCB_ORDC_NEQ, $1, $3); }
	| expr T_GE expr        { $$ = binop(PCB_ORDC_GE, $1, $3); }
	| expr T_LE expr        { $$ = binop(PCB_ORDC_LE, $1, $3); }
	| expr T_GT expr        { $$ = binop(PCB_ORDC_GT, $1, $3); }
	| expr T_LT expr        { $$ = binop(PCB_ORDC_LT, $1, $3); }
	| expr T_AND expr       { $$ = binop(PCB_ORDC_AND, $1, $3); }
	| expr T_OR expr        { $$ = binop(PCB_ORDC_OR, $1, $3); }

	| expr '+' expr         { $$ = binop(PCB_ORDC_ADD, $1, $3); }
	| expr '-' expr         { $$ = binop(PCB_ORDC_SUB, $1, $3); }
	| expr '*' expr         { $$ = binop(PCB_ORDC_MULT, $1, $3); }
	| expr '/' expr         { $$ = binop(PCB_ORDC_DIV, $1, $3); }
	| expr '%' expr         { $$ = binop(PCB_ORDC_MOD, $1, $3); }

	| T_CINT                { $$ = int2node($1); }
	| T_CFLOAT              { $$ = float2node($1); }
	| T_QSTR                { $$ = qstr2node($1); }
	| '$' T_ID              { $$ = var2node($2); }

	| T_INT '(' expr ')'    { $$ = unop(PCB_ORDC_INT, $3); }
	| T_STRING '(' expr ')' { $$ = unop(PCB_ORDC_STRING, $3); }
	| T_FLOAT '(' expr ')'  { $$ = unop(PCB_ORDC_FLOAT, $3); }
	;

/*** statements ***/
stmt_block:
	'{' statements '}'     { $$ = new_node(PCB_ORDC_BLOCK); $$->ch_first = $2; }

statements:
	  /* empty */                         { $$ = NULL; }
	| statement statements                { $$ = $1; $$->next = $2; }
	;

stmt_if:
	T_IF '(' expr ')' statement           { $$ = binop(PCB_ORDC_IF, $3, $5); }
	;

stmt_error:
	T_ERROR '(' T_ID ',' T_QSTR ')' ';'   { $$ = binop(PCB_ORDC_ERROR, id2node($3), qstr2node($5)); }
	;

%%

#include <stdlib.h>
#include <stdio.h>
#include <assert.h>

static pcb_ordc_node_t *new_node(pcb_ordc_node_type_t ty)
{
	pcb_ordc_node_t *n = calloc(sizeof(pcb_ordc_node_t), 1);
	n->type = ty;
	return n;
}

static pcb_ordc_node_t *binop(pcb_ordc_node_type_t ty, pcb_ordc_node_t *a, pcb_ordc_node_t *b)
{
	pcb_ordc_node_t *n = new_node(ty);
	assert((a == NULL) || (a->next == NULL));
	assert((b == NULL) || (b->next == NULL));
	n->ch_first = a;
	if (a != NULL)
		a->next = b;
	return n;
}

#define unop(ty, a) binop(ty, a, NULL)

static pcb_ordc_node_t *id2node(char *s)
{
	pcb_ordc_node_t *n = new_node(PCB_ORDC_ID);
	n->val.s = s;
	return n;
}

static pcb_ordc_node_t *qstr2node(char *s)
{
	pcb_ordc_node_t *n = new_node(PCB_ORDC_QSTR);
	n->val.s = s;
	return n;
}

static pcb_ordc_node_t *var2node(char *s)
{
	pcb_ordc_node_t *n = new_node(PCB_ORDC_VAR);
	n->val.s = s;
	return n;
}

static pcb_ordc_node_t *int2node(long l)
{
	pcb_ordc_node_t *n = new_node(PCB_ORDC_CINT);
	n->val.l = l;
	return n;
}

static pcb_ordc_node_t *float2node(double d)
{
	pcb_ordc_node_t *n = new_node(PCB_ORDC_CFLOAT);
	n->val.d = d;
	return n;
}