Yukihiro "Matz" Matsumoto 90c9525fd7 mruby-compiler: refactor lexer to always return cons lists, move variable node generation to grammar actions ...

Previously the lexer dynamically called new_regx() and new_str() functions
which created different node types based on the var_nodes_enabled flag,
causing complexity in grammar actions and requiring dynamic dispatch handling.

This change simplifies the architecture by:
- Making lexer always return traditional cons structures:
  - tREGEXP: (NODE_REGX . (pattern . (flags . encoding)))
  - tSTRING: (NODE_STR . (string . length))
- Moving variable node generation to grammar actions where it belongs
- Simplifying new_dregx() to always receive traditional cons structures
- Updating mrb_ast_dregx_node to store the whole regx structure

This eliminates dynamic dispatch complexity and centralizes variable node
creation in grammar actions, making the code flow cleaner and more predictable.

Co-authored-by: Claude <noreply@anthropic.com>

2025-10-03 19:46:07 +09:00

..

codegen.c

mruby-compiler: refactor lexer to always return cons lists, move variable node generation to grammar actions

2025-10-03 19:46:07 +09:00

keywords

Fix build for C++ version >= C++11 when enable_cxx_exception; close #5199

2020-12-02 19:15:42 +09:00

lex.def

feat: add pre-commit framework

2021-03-01 10:06:17 +10:00

node.h

mruby-compiler: refactor lexer to always return cons lists, move variable node generation to grammar actions

2025-10-03 19:46:07 +09:00

parse.y

mruby-compiler: refactor lexer to always return cons lists, move variable node generation to grammar actions

2025-10-03 19:46:07 +09:00

y.tab.c

mruby-compiler: refactor lexer to always return cons lists, move variable node generation to grammar actions

2025-10-03 19:46:07 +09:00