parent
e7e0df6b70
commit
846b7aaf16
@ -1,294 +1,82 @@ |
||||
|
||||
#line 1 "lel.rl" |
||||
#include "lel.hpp" |
||||
#include <fmt/core.h> |
||||
|
||||
#include "lel_parser.cpp" |
||||
|
||||
#line 33 "lel.rl" |
||||
|
||||
|
||||
|
||||
#line 7 "lel.cpp" |
||||
static const char _LELParser_actions[] = { |
||||
0, 1, 1, 1, 2, 1, 3, 1,
|
||||
4, 1, 5, 1, 6, 1, 9, 1,
|
||||
10, 1, 11, 2, 0, 7, 2, 0,
|
||||
8, 2, 4, 1, 2, 4, 5 |
||||
}; |
||||
|
||||
static const char _LELParser_key_offsets[] = { |
||||
0, 0, 4, 18, 20, 24, 35, 47,
|
||||
52, 66, 68, 72, 83, 95, 99, 101,
|
||||
104, 106, 109 |
||||
}; |
||||
|
||||
static const char _LELParser_trans_keys[] = { |
||||
32, 91, 9, 13, 32, 40, 42, 46,
|
||||
60, 62, 94, 95, 9, 13, 65, 90,
|
||||
97, 122, 48, 57, 41, 44, 48, 57,
|
||||
40, 42, 46, 60, 62, 94, 95, 65,
|
||||
90, 97, 122, 32, 93, 95, 124, 9,
|
||||
13, 48, 57, 65, 90, 97, 122, 32,
|
||||
93, 124, 9, 13, 32, 40, 42, 46,
|
||||
60, 62, 94, 95, 9, 13, 65, 90,
|
||||
97, 122, 48, 57, 41, 44, 48, 57,
|
||||
40, 42, 46, 60, 62, 94, 95, 65,
|
||||
90, 97, 122, 32, 93, 95, 124, 9,
|
||||
13, 48, 57, 65, 90, 97, 122, 32,
|
||||
93, 9, 13, 48, 57, 41, 48, 57,
|
||||
48, 57, 41, 48, 57, 32, 91, 9,
|
||||
13, 0 |
||||
}; |
||||
|
||||
static const char _LELParser_single_lengths[] = { |
||||
0, 2, 8, 0, 2, 7, 4, 3,
|
||||
8, 0, 2, 7, 4, 2, 0, 1,
|
||||
0, 1, 2 |
||||
}; |
||||
|
||||
static const char _LELParser_range_lengths[] = { |
||||
0, 1, 3, 1, 1, 2, 4, 1,
|
||||
3, 1, 1, 2, 4, 1, 1, 1,
|
||||
1, 1, 1 |
||||
}; |
||||
|
||||
static const char _LELParser_index_offsets[] = { |
||||
0, 0, 4, 16, 18, 22, 32, 41,
|
||||
46, 58, 60, 64, 74, 83, 87, 89,
|
||||
92, 94, 97 |
||||
}; |
||||
|
||||
static const char _LELParser_indicies[] = { |
||||
0, 2, 0, 1, 3, 4, 5, 6,
|
||||
7, 7, 6, 8, 3, 8, 8, 1,
|
||||
9, 1, 10, 11, 12, 1, 4, 5,
|
||||
6, 7, 7, 6, 8, 8, 8, 1,
|
||||
13, 15, 14, 16, 13, 14, 14, 14,
|
||||
1, 17, 18, 19, 17, 1, 20, 21,
|
||||
22, 23, 24, 24, 23, 25, 20, 25,
|
||||
25, 1, 26, 1, 27, 28, 29, 1,
|
||||
21, 22, 23, 24, 24, 23, 25, 25,
|
||||
25, 1, 30, 15, 31, 16, 30, 31,
|
||||
31, 31, 1, 32, 18, 32, 1, 33,
|
||||
1, 34, 35, 1, 36, 1, 37, 38,
|
||||
1, 39, 2, 39, 1, 0 |
||||
}; |
||||
|
||||
static const char _LELParser_trans_targs[] = { |
||||
1, 0, 2, 2, 3, 5, 5, 5,
|
||||
6, 4, 5, 16, 4, 7, 6, 18,
|
||||
8, 7, 18, 8, 8, 9, 11, 11,
|
||||
11, 12, 10, 11, 14, 10, 13, 12,
|
||||
13, 15, 11, 15, 17, 5, 17, 18 |
||||
}; |
||||
|
||||
static const char _LELParser_trans_actions[] = { |
||||
0, 0, 3, 0, 0, 13, 5, 11,
|
||||
17, 15, 19, 19, 0, 7, 0, 28,
|
||||
25, 0, 9, 1, 0, 0, 13, 5,
|
||||
11, 17, 15, 19, 19, 0, 7, 0,
|
||||
0, 15, 22, 0, 15, 22, 0, 0 |
||||
}; |
||||
|
||||
static const int LELParser_start = 1; |
||||
static const int LELParser_first_final = 18; |
||||
static const int LELParser_error = 0; |
||||
|
||||
static const int LELParser_en_main = 1; |
||||
|
||||
|
||||
#line 36 "lel.rl" |
||||
|
||||
bool LELParser::parse(std::string input) { |
||||
int cs = 0; |
||||
const char *start = nullptr; |
||||
const char *begin = input.data(); |
||||
const char *p = input.data(); |
||||
const char *pe = p + input.size(); |
||||
std::string tk; |
||||
|
||||
|
||||
#line 103 "lel.cpp" |
||||
{ |
||||
cs = LELParser_start; |
||||
} |
||||
|
||||
#line 46 "lel.rl" |
||||
|
||||
#line 106 "lel.cpp" |
||||
{ |
||||
int _klen; |
||||
unsigned int _trans; |
||||
const char *_acts; |
||||
unsigned int _nacts; |
||||
const char *_keys; |
||||
|
||||
if ( p == pe ) |
||||
goto _test_eof; |
||||
if ( cs == 0 ) |
||||
goto _out; |
||||
_resume: |
||||
_keys = _LELParser_trans_keys + _LELParser_key_offsets[cs]; |
||||
_trans = _LELParser_index_offsets[cs]; |
||||
LELParser::LELParser(int x, int y, int width, int height) : |
||||
grid_x(x), |
||||
grid_y(y), |
||||
grid_w(width), |
||||
grid_h(height), |
||||
cur(0, 0) |
||||
{ |
||||
|
||||
_klen = _LELParser_single_lengths[cs]; |
||||
if ( _klen > 0 ) { |
||||
const char *_lower = _keys; |
||||
const char *_mid; |
||||
const char *_upper = _keys + _klen - 1; |
||||
while (1) { |
||||
if ( _upper < _lower ) |
||||
break; |
||||
|
||||
_mid = _lower + ((_upper-_lower) >> 1); |
||||
if ( (*p) < *_mid ) |
||||
_upper = _mid - 1; |
||||
else if ( (*p) > *_mid ) |
||||
_lower = _mid + 1; |
||||
else { |
||||
_trans += (unsigned int)(_mid - _keys); |
||||
goto _match; |
||||
} |
||||
} |
||||
_keys += _klen; |
||||
_trans += _klen; |
||||
} |
||||
|
||||
_klen = _LELParser_range_lengths[cs]; |
||||
if ( _klen > 0 ) { |
||||
const char *_lower = _keys; |
||||
const char *_mid; |
||||
const char *_upper = _keys + (_klen<<1) - 2; |
||||
while (1) { |
||||
if ( _upper < _lower ) |
||||
break; |
||||
|
||||
_mid = _lower + (((_upper-_lower) >> 1) & ~1); |
||||
if ( (*p) < _mid[0] ) |
||||
_upper = _mid - 2; |
||||
else if ( (*p) > _mid[1] ) |
||||
_lower = _mid + 2; |
||||
else { |
||||
_trans += (unsigned int)((_mid - _keys)>>1); |
||||
goto _match; |
||||
} |
||||
} |
||||
_trans += _klen; |
||||
} |
||||
|
||||
_match: |
||||
_trans = _LELParser_indicies[_trans]; |
||||
cs = _LELParser_trans_targs[_trans]; |
||||
|
||||
if ( _LELParser_trans_actions[_trans] == 0 ) |
||||
goto _again; |
||||
|
||||
_acts = _LELParser_actions + _LELParser_trans_actions[_trans]; |
||||
_nacts = (unsigned int) *_acts++; |
||||
while ( _nacts-- > 0 ) |
||||
{ |
||||
switch ( *_acts++ ) |
||||
{ |
||||
case 0: |
||||
#line 8 "lel.rl" |
||||
{tk = input.substr(start - begin, p - start); } |
||||
break; |
||||
case 1: |
||||
#line 10 "lel.rl" |
||||
{ col(); } |
||||
break; |
||||
case 2: |
||||
#line 11 "lel.rl" |
||||
{ ltab(); } |
||||
break; |
||||
case 3: |
||||
#line 12 "lel.rl" |
||||
{ valign((*p)); } |
||||
break; |
||||
case 4: |
||||
#line 13 "lel.rl" |
||||
{ id(input.substr(start - begin, p - start)); } |
||||
break; |
||||
case 5: |
||||
#line 14 "lel.rl" |
||||
{ row(); } |
||||
break; |
||||
case 6: |
||||
#line 15 "lel.rl" |
||||
{ align((*p)); } |
||||
break; |
||||
case 7: |
||||
#line 16 "lel.rl" |
||||
{ setwidth(std::stoi(tk)); } |
||||
break; |
||||
case 8: |
||||
#line 17 "lel.rl" |
||||
{ setheight(std::stoi(tk)); } |
||||
break; |
||||
case 9: |
||||
#line 18 "lel.rl" |
||||
{ expand(); } |
||||
break; |
||||
case 10: |
||||
#line 26 "lel.rl" |
||||
{ start = p; } |
||||
break; |
||||
case 11: |
||||
#line 29 "lel.rl" |
||||
{start = p;} |
||||
break; |
||||
#line 215 "lel.cpp" |
||||
} |
||||
} |
||||
|
||||
_again: |
||||
if ( cs == 0 ) |
||||
goto _out; |
||||
if ( ++p != pe ) |
||||
goto _resume; |
||||
_test_eof: {} |
||||
_out: {} |
||||
} |
||||
|
||||
#line 47 "lel.rl" |
||||
|
||||
bool good = pe - p == 0; |
||||
|
||||
return good; |
||||
} |
||||
|
||||
void LELParser::col() { |
||||
fmt::println("col"); |
||||
void LELParser::ltab() { |
||||
cur.row = row_count; |
||||
fmt::println("ltab: rows {}", row_count); |
||||
} |
||||
|
||||
void LELParser::ltab() { |
||||
fmt::println("ltab"); |
||||
void LELParser::col() { |
||||
} |
||||
|
||||
void LELParser::valign(char dir) { |
||||
cur.top = dir == '^'; |
||||
fmt::println("valign: {}", dir); |
||||
} |
||||
|
||||
void LELParser::align(char dir) { |
||||
cur.left = dir == '<'; |
||||
fmt::println("align {}", dir); |
||||
} |
||||
|
||||
void LELParser::id(std::string name) { |
||||
fmt::println("id: {}", name); |
||||
cells.insert_or_assign(name, cur); |
||||
cur = {cur.col + 1, cur.row}; |
||||
} |
||||
|
||||
void LELParser::row() { |
||||
fmt::println("row"); |
||||
row_count++; |
||||
max_columns = std::max(max_columns, cur.col); |
||||
cur.col = 0; |
||||
fmt::println("row end: cols {}", cur.col); |
||||
} |
||||
|
||||
void LELParser::setwidth(int width) { |
||||
fmt::println("setwidth: {}", width); |
||||
cur.w = width; |
||||
} |
||||
|
||||
void LELParser::setheight(int height) { |
||||
fmt::println("setheight: {}", height); |
||||
cur.h = height; |
||||
} |
||||
|
||||
void LELParser::expand() { |
||||
fmt::println("expand"); |
||||
cur.expand = true; |
||||
} |
||||
|
||||
void LELParser::finalize() { |
||||
int cell_width = grid_w / max_columns; |
||||
int cell_height = grid_h / row_count; |
||||
fmt::println("FINALIZE: cell w/h: {},{}", cell_width, cell_height); |
||||
|
||||
for(auto [name, cell] : cells) { |
||||
cell.x = cell.col * cell_width; |
||||
cell.y = cell.row * cell_height; |
||||
if(cell.w == 0) cell.w = cell_width; |
||||
if(cell.x == 0) cell.h = cell_height; |
||||
|
||||
fmt::println("name={}; col/row={},{}; x/y={},{} w/h={},{}; left={}, top={}, expand={}", |
||||
name, cell.col, cell.row, cell.x, cell.y, cell.w, cell.h, cell.left, cell.top, cell.expand); |
||||
} |
||||
} |
||||
|
||||
void LELParser::reset() { |
||||
row_count = 0; |
||||
max_columns = 0; |
||||
cur = {0, 0}; |
||||
} |
||||
|
@ -0,0 +1,42 @@ |
||||
#pragma once |
||||
#include <string> |
||||
#include <unordered_map> |
||||
|
||||
struct Cell { |
||||
int x = 0; |
||||
int y = 0; |
||||
int w = 0; |
||||
int h = 0; |
||||
int col = 0; |
||||
int row = 0; |
||||
bool left = true; |
||||
bool top = true; |
||||
bool expand = false; |
||||
|
||||
Cell(int col, int row) : col(col), row(row) {} |
||||
}; |
||||
|
||||
struct LELParser { |
||||
int grid_x = 0; |
||||
int grid_y = 0; |
||||
int grid_w = 0; |
||||
int grid_h = 0; |
||||
int row_count = 0; |
||||
int max_columns = 0; |
||||
Cell cur; |
||||
std::unordered_map<std::string, Cell> cells; |
||||
|
||||
LELParser(int x, int y, int width, int height); |
||||
void col(); |
||||
void ltab(); |
||||
void align(char dir); |
||||
void valign(char dir); |
||||
void id(std::string name); |
||||
void row(); |
||||
void setwidth(int width); |
||||
void setheight(int height); |
||||
void expand(); |
||||
void reset(); |
||||
bool parse(std::string input); |
||||
void finalize(); |
||||
}; |
@ -0,0 +1,260 @@ |
||||
|
||||
#line 1 "lel_parser.rl" |
||||
#include "lel.hpp" |
||||
#include <fmt/core.h> |
||||
|
||||
|
||||
#line 33 "lel_parser.rl" |
||||
|
||||
|
||||
|
||||
#line 7 "lel_parser.cpp" |
||||
static const char _LELParser_actions[] = { |
||||
0, 1, 1, 1, 2, 1, 3, 1,
|
||||
4, 1, 5, 1, 6, 1, 9, 1,
|
||||
10, 1, 11, 2, 0, 7, 2, 0,
|
||||
8, 2, 4, 1, 2, 4, 5 |
||||
}; |
||||
|
||||
static const char _LELParser_key_offsets[] = { |
||||
0, 0, 4, 18, 20, 24, 35, 47,
|
||||
52, 66, 68, 72, 83, 95, 99, 101,
|
||||
104, 106, 109 |
||||
}; |
||||
|
||||
static const char _LELParser_trans_keys[] = { |
||||
32, 91, 9, 13, 32, 40, 42, 46,
|
||||
60, 62, 94, 95, 9, 13, 65, 90,
|
||||
97, 122, 48, 57, 41, 44, 48, 57,
|
||||
40, 42, 46, 60, 62, 94, 95, 65,
|
||||
90, 97, 122, 32, 93, 95, 124, 9,
|
||||
13, 48, 57, 65, 90, 97, 122, 32,
|
||||
93, 124, 9, 13, 32, 40, 42, 46,
|
||||
60, 62, 94, 95, 9, 13, 65, 90,
|
||||
97, 122, 48, 57, 41, 44, 48, 57,
|
||||
40, 42, 46, 60, 62, 94, 95, 65,
|
||||
90, 97, 122, 32, 93, 95, 124, 9,
|
||||
13, 48, 57, 65, 90, 97, 122, 32,
|
||||
93, 9, 13, 48, 57, 41, 48, 57,
|
||||
48, 57, 41, 48, 57, 32, 91, 9,
|
||||
13, 0 |
||||
}; |
||||
|
||||
static const char _LELParser_single_lengths[] = { |
||||
0, 2, 8, 0, 2, 7, 4, 3,
|
||||
8, 0, 2, 7, 4, 2, 0, 1,
|
||||
0, 1, 2 |
||||
}; |
||||
|
||||
static const char _LELParser_range_lengths[] = { |
||||
0, 1, 3, 1, 1, 2, 4, 1,
|
||||
3, 1, 1, 2, 4, 1, 1, 1,
|
||||
1, 1, 1 |
||||
}; |
||||
|
||||
static const char _LELParser_index_offsets[] = { |
||||
0, 0, 4, 16, 18, 22, 32, 41,
|
||||
46, 58, 60, 64, 74, 83, 87, 89,
|
||||
92, 94, 97 |
||||
}; |
||||
|
||||
static const char _LELParser_indicies[] = { |
||||
0, 2, 0, 1, 3, 4, 5, 6,
|
||||
7, 7, 6, 8, 3, 8, 8, 1,
|
||||
9, 1, 10, 11, 12, 1, 4, 5,
|
||||
6, 7, 7, 6, 8, 8, 8, 1,
|
||||
13, 15, 14, 16, 13, 14, 14, 14,
|
||||
1, 17, 18, 19, 17, 1, 20, 21,
|
||||
22, 23, 24, 24, 23, 25, 20, 25,
|
||||
25, 1, 26, 1, 27, 28, 29, 1,
|
||||
21, 22, 23, 24, 24, 23, 25, 25,
|
||||
25, 1, 30, 15, 31, 16, 30, 31,
|
||||
31, 31, 1, 32, 18, 32, 1, 33,
|
||||
1, 34, 35, 1, 36, 1, 37, 38,
|
||||
1, 39, 2, 39, 1, 0 |
||||
}; |
||||
|
||||
static const char _LELParser_trans_targs[] = { |
||||
1, 0, 2, 2, 3, 5, 5, 5,
|
||||
6, 4, 5, 16, 4, 7, 6, 18,
|
||||
8, 7, 18, 8, 8, 9, 11, 11,
|
||||
11, 12, 10, 11, 14, 10, 13, 12,
|
||||
13, 15, 11, 15, 17, 5, 17, 18 |
||||
}; |
||||
|
||||
static const char _LELParser_trans_actions[] = { |
||||
0, 0, 3, 0, 0, 13, 5, 11,
|
||||
17, 15, 19, 19, 0, 7, 0, 28,
|
||||
25, 0, 9, 1, 0, 0, 13, 5,
|
||||
11, 17, 15, 19, 19, 0, 7, 0,
|
||||
0, 15, 22, 0, 15, 22, 0, 0 |
||||
}; |
||||
|
||||
static const int LELParser_start = 1; |
||||
static const int LELParser_first_final = 18; |
||||
static const int LELParser_error = 0; |
||||
|
||||
static const int LELParser_en_main = 1; |
||||
|
||||
|
||||
#line 36 "lel_parser.rl" |
||||
|
||||
bool LELParser::parse(std::string input) { |
||||
reset(); |
||||
int cs = 0; |
||||
const char *start = nullptr; |
||||
const char *begin = input.data(); |
||||
const char *p = input.data(); |
||||
const char *pe = p + input.size(); |
||||
std::string tk; |
||||
|
||||
|
||||
#line 104 "lel_parser.cpp" |
||||
{ |
||||
cs = LELParser_start; |
||||
} |
||||
|
||||
#line 47 "lel_parser.rl" |
||||
|
||||
#line 107 "lel_parser.cpp" |
||||
{ |
||||
int _klen; |
||||
unsigned int _trans; |
||||
const char *_acts; |
||||
unsigned int _nacts; |
||||
const char *_keys; |
||||
|
||||
if ( p == pe ) |
||||
goto _test_eof; |
||||
if ( cs == 0 ) |
||||
goto _out; |
||||
_resume: |
||||
_keys = _LELParser_trans_keys + _LELParser_key_offsets[cs]; |
||||
_trans = _LELParser_index_offsets[cs]; |
||||
|
||||
_klen = _LELParser_single_lengths[cs]; |
||||
if ( _klen > 0 ) { |
||||
const char *_lower = _keys; |
||||
const char *_mid; |
||||
const char *_upper = _keys + _klen - 1; |
||||
while (1) { |
||||
if ( _upper < _lower ) |
||||
break; |
||||
|
||||
_mid = _lower + ((_upper-_lower) >> 1); |
||||
if ( (*p) < *_mid ) |
||||
_upper = _mid - 1; |
||||
else if ( (*p) > *_mid ) |
||||
_lower = _mid + 1; |
||||
else { |
||||
_trans += (unsigned int)(_mid - _keys); |
||||
goto _match; |
||||
} |
||||
} |
||||
_keys += _klen; |
||||
_trans += _klen; |
||||
} |
||||
|
||||
_klen = _LELParser_range_lengths[cs]; |
||||
if ( _klen > 0 ) { |
||||
const char *_lower = _keys; |
||||
const char *_mid; |
||||
const char *_upper = _keys + (_klen<<1) - 2; |
||||
while (1) { |
||||
if ( _upper < _lower ) |
||||
break; |
||||
|
||||
_mid = _lower + (((_upper-_lower) >> 1) & ~1); |
||||
if ( (*p) < _mid[0] ) |
||||
_upper = _mid - 2; |
||||
else if ( (*p) > _mid[1] ) |
||||
_lower = _mid + 2; |
||||
else { |
||||
_trans += (unsigned int)((_mid - _keys)>>1); |
||||
goto _match; |
||||
} |
||||
} |
||||
_trans += _klen; |
||||
} |
||||
|
||||
_match: |
||||
_trans = _LELParser_indicies[_trans]; |
||||
cs = _LELParser_trans_targs[_trans]; |
||||
|
||||
if ( _LELParser_trans_actions[_trans] == 0 ) |
||||
goto _again; |
||||
|
||||
_acts = _LELParser_actions + _LELParser_trans_actions[_trans]; |
||||
_nacts = (unsigned int) *_acts++; |
||||
while ( _nacts-- > 0 ) |
||||
{ |
||||
switch ( *_acts++ ) |
||||
{ |
||||
case 0: |
||||
#line 8 "lel_parser.rl" |
||||
{tk = input.substr(start - begin, p - start); } |
||||
break; |
||||
case 1: |
||||
#line 10 "lel_parser.rl" |
||||
{ col(); } |
||||
break; |
||||
case 2: |
||||
#line 11 "lel_parser.rl" |
||||
{ ltab(); } |
||||
break; |
||||
case 3: |
||||
#line 12 "lel_parser.rl" |
||||
{ valign((*p)); } |
||||
break; |
||||
case 4: |
||||
#line 13 "lel_parser.rl" |
||||
{ id(input.substr(start - begin, p - start)); } |
||||
break; |
||||
case 5: |
||||
#line 14 "lel_parser.rl" |
||||
{ row(); } |
||||
break; |
||||
case 6: |
||||
#line 15 "lel_parser.rl" |
||||
{ align((*p)); } |
||||
break; |
||||
case 7: |
||||
#line 16 "lel_parser.rl" |
||||
{ setwidth(std::stoi(tk)); } |
||||
break; |
||||
case 8: |
||||
#line 17 "lel_parser.rl" |
||||
{ setheight(std::stoi(tk)); } |
||||
break; |
||||
case 9: |
||||
#line 18 "lel_parser.rl" |
||||
{ expand(); } |
||||
break; |
||||
case 10: |
||||
#line 26 "lel_parser.rl" |
||||
{ start = p; } |
||||
break; |
||||
case 11: |
||||
#line 29 "lel_parser.rl" |
||||
{start = p;} |
||||
break; |
||||
#line 216 "lel_parser.cpp" |
||||
} |
||||
} |
||||
|
||||
_again: |
||||
if ( cs == 0 ) |
||||
goto _out; |
||||
if ( ++p != pe ) |
||||
goto _resume; |
||||
_test_eof: {} |
||||
_out: {} |
||||
} |
||||
|
||||
#line 48 "lel_parser.rl" |
||||
|
||||
bool good = pe - p == 0; |
||||
finalize(); |
||||
|
||||
return good; |
||||
} |
Loading…
Reference in new issue