|
Lime Parser Generator 0.1.0
Runtime-extensible LALR(1) parser with SIMD tokenization and LLVM JIT
|
Graph-Structured Stack (GSS) node for GLR parsing. More...
#include <glr.h>
Data Fields | ||
| uint32_t | npred | |
| Number of predecessors. | ||
| uint32_t | pred_capacity | |
| Allocated predecessor slots. | ||
| struct GSSNode ** | predecessors | |
| Array of predecessor nodes. | ||
| uint32_t | refcount | |
| Reference count. | ||
| uint32_t | state | |
| Parser state number. | ||
| union { | ||
| double dval | ||
| int ival | ||
| void * pval | ||
| } | value | |
| Semantic value (one of int / pointer / double, by convention). | ||
Graph-Structured Stack (GSS) node for GLR parsing.
Each node represents a parser state in the GLR graph. Multiple predecessor links allow the graph structure that distinguishes GLR from standard LR parsing.
| struct GSSNode** GSSNode::predecessors |