jaclang 0.8.9__py3-none-any.whl → 0.8.10__py3-none-any.whl

jaclang/compiler/parser.py

@@ -3,17 +3,17 @@
 from __future__ import annotations
 
 import keyword
-import logging
 import os
 import sys
-from typing import Callable, Sequence, TYPE_CHECKING, TypeAlias, TypeVar, cast
+from dataclasses import dataclass
+from threading import Event
+from typing import Callable, Optional, Sequence, TYPE_CHECKING, TypeAlias, TypeVar, cast
 
 import jaclang.compiler.unitree as uni
 from jaclang.compiler import TOKEN_MAP, jac_lark as jl
 from jaclang.compiler.constant import EdgeDir, Tokens as Tok
 from jaclang.compiler.passes.main import Transform
 from jaclang.utils.helpers import ANSIColors
-from jaclang.vendor.lark import Lark, Transformer, Tree, logger
 
 if TYPE_CHECKING:
     from jaclang.compiler.program import JacProgram
@@ -22,25 +22,70 @@ T = TypeVar("T", bound=uni.UniNode)
 TL = TypeVar("TL", bound=(uni.UniNode | list))
 
 
+@dataclass
+class LarkParseInput:
+    """Input for Lark parser transform."""
+
+    ir_value: str
+    on_error: Callable[[jl.UnexpectedInput], bool]
+
+
+@dataclass
+class LarkParseOutput:
+    """Output from Lark parser transform."""
+
+    tree: jl.Tree[jl.Tree[str]]
+    comments: list[jl.Token]
+
+
+class LarkParseTransform(Transform[LarkParseInput, LarkParseOutput]):
+    """Transform for Lark parsing step."""
+
+    comment_cache: list[jl.Token] = []
+    parser = jl.Lark_StandAlone(
+        lexer_callbacks={"COMMENT": lambda comment: LarkParseTransform.comment_cache.append(comment)}  # type: ignore
+    )
+
+    def __init__(self, ir_in: LarkParseInput, prog: JacProgram) -> None:
+        """Initialize Lark parser transform."""
+        Transform.__init__(self, ir_in=ir_in, prog=prog)
+
+    def transform(self, ir_in: LarkParseInput) -> LarkParseOutput:
+        """Transform input IR by parsing with Lark."""
+        LarkParseTransform.comment_cache = []
+        tree = LarkParseTransform.parser.parse(ir_in.ir_value, on_error=ir_in.on_error)
+        return LarkParseOutput(
+            tree=tree,
+            comments=LarkParseTransform.comment_cache.copy(),
+        )
+
+
 class JacParser(Transform[uni.Source, uni.Module]):
     """Jac Parser."""
 
-    dev_mode = False
-
-    def __init__(self, root_ir: uni.Source, prog: JacProgram) -> None:
+    def __init__(
+        self, root_ir: uni.Source, prog: JacProgram, cancel_token: Event | None = None
+    ) -> None:
         """Initialize parser."""
         self.mod_path = root_ir.loc.mod_path
         self.node_list: list[uni.UniNode] = []
-        if JacParser.dev_mode:
-            JacParser.make_dev()
-        Transform.__init__(self, ir_in=root_ir, prog=prog)
+        self._node_ids: set[int] = set()
+        Transform.__init__(self, ir_in=root_ir, prog=prog, cancel_token=cancel_token)
 
     def transform(self, ir_in: uni.Source) -> uni.Module:
         """Transform input IR."""
         try:
-            tree, comments = JacParser.parse(ir_in.value, on_error=self.error_callback)
-            mod = JacParser.TreeToAST(parser=self).transform(tree)
-            ir_in.comments = [self.proc_comment(i, mod) for i in comments]
+            # Create input for Lark parser transform
+            lark_input = LarkParseInput(
+                ir_value=ir_in.value,
+                on_error=self.error_callback,
+            )
+            # Use LarkParseTransform instead of direct parser call
+            lark_transform = LarkParseTransform(ir_in=lark_input, prog=self.prog)
+            parse_output = lark_transform.ir_out
+            # Transform parse tree to AST
+            mod = JacParser.TreeToAST(parser=self).transform(parse_output.tree)
+            ir_in.comments = [self.proc_comment(i, mod) for i in parse_output.comments]
             if not isinstance(mod, uni.Module):
                 raise self.ice()
             if len(self.errors_had) != 0:
@@ -190,37 +235,6 @@ class JacParser(Transform[uni.Source, uni.Module]):
             print(error_label, end=" ", file=sys.stderr)
             print(alrt.pretty_print(colors=colors), file=sys.stderr)
 
-    @staticmethod
-    def _comment_callback(comment: jl.Token) -> None:
-        JacParser.comment_cache.append(comment)
-
-    @staticmethod
-    def parse(
-        ir: str, on_error: Callable[[jl.UnexpectedInput], bool]
-    ) -> tuple[jl.Tree[jl.Tree[str]], list[jl.Token]]:
-        """Parse input IR."""
-        JacParser.comment_cache = []
-        return (
-            JacParser.parser.parse(ir, on_error=on_error),
-            JacParser.comment_cache,
-        )
-
-    @staticmethod
-    def make_dev() -> None:
-        """Make parser in dev mode."""
-        JacParser.parser = Lark.open(
-            "jac.lark",
-            parser="lalr",
-            rel_to=__file__,
-            debug=True,
-            lexer_callbacks={"COMMENT": JacParser._comment_callback},
-        )
-        JacParser.JacTransformer = Transformer[Tree[str], uni.UniNode]  # type: ignore
-        logger.setLevel(logging.DEBUG)
-
-    comment_cache: list[jl.Token] = []
-
-    parser = jl.Lark_StandAlone(lexer_callbacks={"COMMENT": _comment_callback})  # type: ignore
     JacTransformer: TypeAlias = jl.Transformer[jl.Tree[str], uni.UniNode]
 
     class TreeToAST(JacTransformer):
@@ -245,7 +259,9 @@ class JacParser(Transform[uni.Source, uni.Module]):
 
         def _node_update(self, node: T) -> T:
             self.parse_ref.cur_node = node
-            if node not in self.parse_ref.node_list:
+            node_id = id(node)
+            if node_id not in self.parse_ref._node_ids:
+                self.parse_ref._node_ids.add(node_id)
                 self.parse_ref.node_list.append(node)
             return node
 
@@ -253,6 +269,8 @@ class JacParser(Transform[uni.Source, uni.Module]):
             self, tree: jl.Tree, new_children: None | list[uni.UniNode] = None
         ) -> uni.UniNode:
             self.cur_nodes = new_children or tree.children  # type: ignore[assignment]
+            if self.parse_ref.is_canceled():
+                raise StopIteration
             try:
                 return self._node_update(super()._call_userfunc(tree, new_children))
             finally:
@@ -372,17 +390,29 @@ class JacParser(Transform[uni.Source, uni.Module]):
                 | STRING (tl_stmt_with_doc | toplevel_stmt)*
             """
             doc = self.match(uni.String)
-            body = self.match_many(uni.ElementStmt)
+            # Collect all statements, flattening lists from cl { ... } blocks
+            body: list[uni.ElementStmt] = []
+            flat_kids: list[uni.UniNode] = []
+
+            for node in self.cur_nodes:
+                if isinstance(node, list):
+                    # This is a list from cl { } block
+                    body.extend(node)
+                    flat_kids.extend(node)
+                elif isinstance(node, uni.ElementStmt):
+                    body.append(node)
+                    flat_kids.append(node)
+                else:
+                    flat_kids.append(node)
+
             mod = uni.Module(
                 name=self.parse_ref.mod_path.split(os.path.sep)[-1].rstrip(".jac"),
                 source=self.parse_ref.ir_in,
                 doc=doc,
                 body=body,
                 terminals=self.terminals,
-                kid=(
-                    self.cur_nodes
-                    or [uni.EmptyToken(uni.Source("", self.parse_ref.mod_path))]
-                ),
+                kid=flat_kids
+                or [uni.EmptyToken(uni.Source("", self.parse_ref.mod_path))],
             )
             return mod
 
@@ -397,19 +427,48 @@ class JacParser(Transform[uni.Source, uni.Module]):
             element.add_kids_left([doc])
             return element
 
-        def toplevel_stmt(self, _: None) -> uni.ElementStmt:
+        def onelang_stmt(self, _: None) -> uni.ElementStmt:
             """Grammar rule.
 
-            toplevel_stmt: import_stmt
+            onelang_stmt: import_stmt
                 | archetype
                 | ability
                 | global_var
                 | free_code
-                | py_code_block
                 | test
+                | impl_def
+                | sem_def
             """
             return self.consume(uni.ElementStmt)
 
+        def toplevel_stmt(self, _: None) -> uni.ElementStmt | list[uni.ElementStmt]:
+            """Grammar rule.
+
+            toplevel_stmt: KW_CLIENT? onelang_stmt
+                | KW_CLIENT LBRACE onelang_stmt* RBRACE
+                | py_code_block
+            """
+            client_tok = self.match_token(Tok.KW_CLIENT)
+            if client_tok:
+                lbrace = self.match_token(Tok.LBRACE)
+                if lbrace:
+                    # Collect all statements in the block
+                    elements: list[uni.ElementStmt] = []
+                    while elem := self.match(uni.ElementStmt):
+                        if isinstance(elem, uni.ClientFacingNode):
+                            elem.is_client_decl = True
+                        elements.append(elem)
+                    self.consume(uni.Token)  # RBRACE
+                    return elements
+                else:
+                    element = self.consume(uni.ElementStmt)
+                    if isinstance(element, uni.ClientFacingNode):
+                        element.is_client_decl = True
+                        element.add_kids_left([client_tok])
+                    return element
+            else:
+                return self.consume(uni.ElementStmt)
+
         def global_var(self, _: None) -> uni.GlobalVars:
             """Grammar rule.
 
@@ -866,14 +925,14 @@ class JacParser(Transform[uni.Source, uni.Module]):
         def ability_decl(self, _: None) -> uni.Ability:
             """Grammar rule.
 
-            ability_decl: KW_OVERRIDE? KW_STATIC? KW_CAN access_tag? named_ref
+            ability_decl: KW_OVERRIDE? KW_STATIC? KW_CAN access_tag? named_ref?
                 event_clause (block_tail | KW_ABSTRACT? SEMI)
             """
             is_override = self.match_token(Tok.KW_OVERRIDE) is not None
             is_static = self.match_token(Tok.KW_STATIC) is not None
             self.consume_token(Tok.KW_CAN)
             access = self.match(uni.SubTag)
-            name = self.consume(uni.NameAtom)
+            name = self.match(uni.NameAtom)
             signature = self.consume(uni.EventSignature)
 
             # Handle block_tail
@@ -1708,44 +1767,90 @@ class JacParser(Transform[uni.Source, uni.Module]):
         def lambda_expr(self, _: None) -> uni.LambdaExpr:
             """Grammar rule.
 
-            lambda_expr: KW_LAMBDA func_decl_params? (RETURN_HINT expression)? COLON expression
+            lambda_expr: KW_LAMBDA func_decl_params? (RETURN_HINT expression)? ( COLON expression | code_block )
             """
             return_type: uni.Expr | None = None
             return_hint_tok: uni.Token | None = None
             sig_kid: list[uni.UniNode] = []
             self.consume_token(Tok.KW_LAMBDA)
-            params = self.match(list)
-            if return_hint_tok := self.match_token(Tok.RETURN_HINT):
-                return_type = self.consume(uni.Expr)
-            self.consume_token(Tok.COLON)
-            body = self.consume(uni.Expr)
-            if params:
-                sig_kid.extend(params)
-            if return_hint_tok:
-                sig_kid.append(return_hint_tok)
-            if return_type:
-                sig_kid.append(return_type)
-            signature = (
-                uni.FuncSignature(
-                    posonly_params=[],
-                    params=(
-                        self.extract_from_list(params, uni.ParamVar) if params else []
-                    ),
-                    varargs=None,
-                    kwonlyargs=[],
-                    kwargs=None,
-                    return_type=return_type,
-                    kid=sig_kid,
+            param_nodes: list[uni.UniNode] | None = None
+            signature = self.match(uni.FuncSignature)
+            signature_created = False
+            if not signature:
+                if self.node_idx < len(self.cur_nodes) and isinstance(
+                    self.cur_nodes[self.node_idx], list
+                ):
+                    candidate: list[uni.UniNode] = self.cur_nodes[self.node_idx]  # type: ignore[assignment]
+                    first = candidate[0] if candidate else None
+                    if not (
+                        isinstance(first, uni.Token) and first.name == Tok.LBRACE.name
+                    ):
+                        param_nodes = self.consume(list)
+                elif (
+                    self.node_idx < len(self.cur_nodes)
+                    and isinstance(self.cur_nodes[self.node_idx], uni.Token)
+                    and self.cur_nodes[self.node_idx].name == Tok.LPAREN.name
+                ):
+                    self.consume_token(Tok.LPAREN)
+                    param_nodes = self.match(list)
+                    self.consume_token(Tok.RPAREN)
+                if return_hint_tok := self.match_token(Tok.RETURN_HINT):
+                    return_type = self.consume(uni.Expr)
+                if param_nodes:
+                    sig_kid.extend(param_nodes)
+                if return_hint_tok:
+                    sig_kid.append(return_hint_tok)
+                if return_type:
+                    sig_kid.append(return_type)
+                signature = (
+                    uni.FuncSignature(
+                        posonly_params=[],
+                        params=(
+                            self.extract_from_list(param_nodes, uni.ParamVar)
+                            if param_nodes
+                            else []
+                        ),
+                        varargs=None,
+                        kwonlyargs=[],
+                        kwargs=None,
+                        return_type=return_type,
+                        kid=sig_kid,
+                    )
+                    if param_nodes or return_type
+                    else None
                 )
-                if params or return_type
-                else None
-            )
-            new_kid = [
-                i
-                for i in self.cur_nodes
-                if i != params and i != return_type and i != return_hint_tok
-            ]
-            new_kid.insert(1, signature) if signature else None
+                signature_created = signature is not None
+
+            # Check if body is a code block or expression
+            block_nodes: list[uni.UniNode] | None = None
+            if self.match_token(Tok.COLON):
+                # Single-expression body
+                body: uni.Expr | list[uni.CodeBlockStmt] = self.consume(uni.Expr)
+            else:
+                if self.node_idx < len(self.cur_nodes) and isinstance(
+                    self.cur_nodes[self.node_idx], list
+                ):
+                    block_nodes = self.consume(list)
+                    body = self.extract_from_list(block_nodes, uni.CodeBlockStmt)
+                else:
+                    self.consume_token(Tok.LBRACE)
+                    body_stmts: list[uni.CodeBlockStmt] = []
+                    while not self.match_token(Tok.RBRACE):
+                        body_stmts.append(self.consume(uni.CodeBlockStmt))
+                    body = body_stmts
+
+            new_kid: list[uni.UniNode] = []
+            for item in self.cur_nodes:
+                if param_nodes is not None and item is param_nodes:
+                    continue
+                if item is return_type or item is return_hint_tok:
+                    continue
+                if block_nodes is not None and item is block_nodes:
+                    new_kid.extend(block_nodes)
+                else:
+                    new_kid.append(item)
+            if signature_created and signature:
+                new_kid.insert(1, signature)
             return uni.LambdaExpr(
                 signature=signature,
                 body=body,
@@ -2141,13 +2246,19 @@ class JacParser(Transform[uni.Source, uni.Module]):
             """Grammar rule.
 
             atom: named_ref
-                 | LPAREN (expression | yield_expr) RPAREN
+                 | LPAREN (expression | yield_expr | function_decl) RPAREN
                  | atom_collection
                  | atom_literal
                  | type_ref
+                 | jsx_element
             """
             if self.match_token(Tok.LPAREN):
-                value = self.match(uni.Expr) or self.consume(uni.YieldExpr)
+                # Try to match expression first, then yield_expr, then function_decl
+                value = self.match(uni.Expr)
+                if value is None:
+                    value = self.match(uni.YieldExpr)
+                if value is None:
+                    value = self.consume(uni.Ability)
                 self.consume_token(Tok.RPAREN)
                 return uni.AtomUnit(value=value, kid=self.cur_nodes)
             return self.consume(uni.AtomExpr)
@@ -2212,108 +2323,142 @@ class JacParser(Transform[uni.Source, uni.Module]):
         def fstring(self, _: None) -> uni.FString:
             """Grammar rule.
 
-            fstring: FSTR_START fstr_parts FSTR_END
-                | FSTR_SQ_START fstr_sq_parts FSTR_SQ_END
-                | FSTR_TRIPLE_START fstr_triple_parts FSTR_TRIPLE_END
-                | FSTR_SQ_TRIPLE_START fstr_sq_triple_parts FSTR_SQ_TRIPLE_END
+            fstring: F_DQ_START fstr_dq_part* F_DQ_END
+                    | F_SQ_START fstr_sq_part* F_SQ_END
             """
-            (
-                self.match_token(Tok.FSTR_TRIPLE_START)
-                or self.match_token(Tok.FSTR_SQ_TRIPLE_START)
-                or self.match_token(Tok.FSTR_START)
-                or self.consume_token(Tok.FSTR_SQ_START)
-            )
-            target = self.match(list)
-            (
-                self.match_token(Tok.FSTR_TRIPLE_END)
-                or self.match_token(Tok.FSTR_SQ_TRIPLE_END)
-                or self.match_token(Tok.FSTR_END)
-                or self.consume_token(Tok.FSTR_SQ_END)
-            )
+            fstring_configs = [
+                ([Tok.F_DQ_START, Tok.RF_DQ_START], Tok.F_DQ_END),
+                ([Tok.F_SQ_START, Tok.RF_SQ_START], Tok.F_SQ_END),
+                ([Tok.F_TDQ_START, Tok.RF_TDQ_START], Tok.F_TDQ_END),
+                ([Tok.F_TSQ_START, Tok.RF_TSQ_START], Tok.F_TSQ_END),
+            ]
+
+            for start_toks, end_tok in fstring_configs:
+                if fstr := self._process_fstring(start_toks, end_tok):
+                    return fstr
+
+            raise self.ice()
+
+        def _process_fstring(
+            self, start_tok: list[Tok], end_tok: Tok
+        ) -> Optional[uni.FString]:
+            """Process fstring nodes."""
+            tok_start = self.match_token(start_tok[0]) or self.match_token(start_tok[1])
+            if not tok_start:
+                return None
+            parts = []
+            while part := self.match(uni.String) or self.match(uni.FormattedValue):
+                parts.append(part)
+            tok_end = self.consume_token(end_tok)
             return uni.FString(
-                parts=(
-                    self.extract_from_list(target, (uni.String, uni.ExprStmt))
-                    if target
-                    else []
-                ),
+                start=tok_start,
+                parts=parts,
+                end=tok_end,
                 kid=self.flat_cur_nodes,
             )
 
-        def fstr_parts(self, _: None) -> list[uni.UniNode]:
+        def fstr_dq_part(self, _: None) -> uni.Token | uni.FormattedValue:
             """Grammar rule.
 
-            fstr_parts: (FSTR_PIECE | FSTR_BESC | LBRACE expression RBRACE )*
+            fstr_dq_part: F_TEXT_DQ | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
             """
-            valid_parts: list[uni.UniNode] = [
-                (
-                    i
-                    if isinstance(i, uni.String)
-                    else (
-                        uni.ExprStmt(expr=i, in_fstring=True, kid=[i])
-                        if isinstance(i, uni.Expr)
-                        else i
-                    )
-                )
-                for i in self.cur_nodes
-            ]
-            return valid_parts
+            return self._process_f_expr(Tok.F_TEXT_DQ, self.cur_nodes)
 
-        def fstr_sq_parts(self, _: None) -> list[uni.UniNode]:
+        def fstr_sq_part(self, _: None) -> uni.Token | uni.FormattedValue:
             """Grammar rule.
 
-            fstr_sq_parts: (FSTR_SQ_PIECE | FSTR_BESC | LBRACE expression RBRACE )*
+            fstr_sq_part: F_TEXT_SQ | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
             """
-            valid_parts: list[uni.UniNode] = [
-                (
-                    i
-                    if isinstance(i, uni.String)
-                    else (
-                        uni.ExprStmt(expr=i, in_fstring=True, kid=[i])
-                        if isinstance(i, uni.Expr)
-                        else i
-                    )
-                )
-                for i in self.cur_nodes
-            ]
-            return valid_parts
+            return self._process_f_expr(Tok.F_TEXT_SQ, self.cur_nodes)
 
-        def fstr_triple_parts(self, _: None) -> list[uni.UniNode]:
+        def fstr_tdq_part(self, _: None) -> uni.Token | uni.FormattedValue:
             """Grammar rule.
 
-            fstr_triple_parts: (FSTR_TRIPLE_PIECE | FSTR_BESC | LBRACE expression RBRACE )*
+            fstr_tdq_part: F_TEXT_DQ | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
             """
-            valid_parts: list[uni.UniNode] = [
-                (
-                    i
-                    if isinstance(i, uni.String)
-                    else (
-                        uni.ExprStmt(expr=i, in_fstring=True, kid=[i])
-                        if isinstance(i, uni.Expr)
-                        else i
-                    )
-                )
-                for i in self.cur_nodes
-            ]
-            return valid_parts
+            return self._process_f_expr(Tok.F_TEXT_TDQ, self.cur_nodes)
 
-        def fstr_sq_triple_parts(self, _: None) -> list[uni.UniNode]:
+        def fstr_tsq_part(self, _: None) -> uni.Token | uni.FormattedValue:
             """Grammar rule.
 
-            fstr_sq_triple_parts: (FSTR_SQ_TRIPLE_PIECE | FSTR_BESC | LBRACE expression RBRACE )*
+            fstr_sq_part: F_TEXT_SQ | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
             """
-            valid_parts: list[uni.UniNode] = [
-                (
-                    i
-                    if isinstance(i, uni.String)
-                    else (
-                        uni.ExprStmt(expr=i, in_fstring=True, kid=[i])
-                        if isinstance(i, uni.Expr)
-                        else i
-                    )
+            return self._process_f_expr(Tok.F_TEXT_TSQ, self.cur_nodes)
+
+        def rfstr_dq_part(self, _: None) -> uni.Token | uni.FormattedValue:
+            """Grammar rule.
+
+            fstr_dq_part: F_TEXT_DQ | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
+            """
+            return self._process_f_expr(Tok.RF_TEXT_DQ, self.cur_nodes)
+
+        def rfstr_sq_part(self, _: None) -> uni.Token | uni.FormattedValue:
+            """Grammar rule.
+
+            fstr_sq_part: F_TEXT_SQ | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
+            """
+            return self._process_f_expr(Tok.RF_TEXT_SQ, self.cur_nodes)
+
+        def rfstr_tdq_part(self, _: None) -> uni.Token | uni.FormattedValue:
+            """Grammar rule.
+
+            fstr_tdq_part: F_TEXT_DQ | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
+            """
+            return self._process_f_expr(Tok.RF_TEXT_TDQ, self.cur_nodes)
+
+        def rfstr_tsq_part(self, _: None) -> uni.Token | uni.FormattedValue:
+            """Grammar rule.
+
+            fstr_sq_part: F_TEXT_SQ | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
+            """
+            return self._process_f_expr(Tok.RF_TEXT_TSQ, self.cur_nodes)
+
+        def fformat(self, _: None) -> uni.Token | uni.FormattedValue:
+            """Grammar rule.
+
+            fformat: F_FORMAT_TEXT | D_LBRACE | D_RBRACE | LBRACE expression CONV? (COLON fformat*)? RBRACE
+            """
+            return self._process_f_expr(Tok.F_FORMAT_TEXT, self.cur_nodes)
+
+        def _process_f_expr(
+            self, token: Tok, nodes: list[uni.UniNode]
+        ) -> uni.Token | uni.FormattedValue:
+            """Process fexpression nodes."""
+            if (
+                tok := self.match_token(token)
+                or self.match_token(Tok.D_LBRACE)
+                or self.match_token(Tok.D_RBRACE)
+            ):
+                return tok
+            else:
+                conversion = -1
+                format_spec = None
+                self.consume_token(Tok.LBRACE)
+                expr = self.consume(uni.Expr)
+                if conv_tok := self.match_token(Tok.CONV):
+                    conversion = ord(conv_tok.value[1:])
+                if self.match_token(Tok.COLON):
+                    parts = []
+                    while part := self.match(uni.String) or self.match(
+                        uni.FormattedValue
+                    ):
+                        parts.append(part)
+                    if len(parts) == 1 and isinstance(parts[0], uni.String):
+                        format_spec = parts[0]
+                    elif parts:
+                        format_spec = uni.FString(
+                            start=None,
+                            parts=parts,
+                            end=None,
+                            kid=parts,
+                        )
+                self.consume_token(Tok.RBRACE)
+                return uni.FormattedValue(
+                    format_part=expr,
+                    conversion=conversion,
+                    format_spec=format_spec,
+                    kid=self.cur_nodes,
                 )
-                for i in self.cur_nodes
-            ]
-            return valid_parts
 
         def list_val(self, _: None) -> uni.ListVal:
             """Grammar rule.
@@ -2583,6 +2728,244 @@ class JacParser(Transform[uni.Source, uni.Module]):
                 kid=self.cur_nodes,
             )
 
+        def jsx_element(self, _: None) -> uni.JsxElement:
+            """Grammar rule.
+
+            jsx_element: jsx_self_closing
+                       | jsx_fragment
+                       | jsx_opening_closing
+            """
+            return self.consume(uni.JsxElement)
+
+        def jsx_self_closing(self, _: None) -> uni.JsxElement:
+            """Grammar rule.
+
+            jsx_self_closing: JSX_OPEN_START jsx_element_name jsx_attributes? JSX_SELF_CLOSE
+            """
+            self.consume_token(Tok.JSX_OPEN_START)
+            name = self.consume(uni.JsxElementName)
+            # jsx_attributes is optional and returns a list when present
+            attrs_list = self.match(
+                list
+            )  # Will match jsx_attributes which returns a list
+            attrs = attrs_list if attrs_list else []
+            self.consume_token(Tok.JSX_SELF_CLOSE)
+
+            return uni.JsxElement(
+                name=name,
+                attributes=attrs,
+                children=None,
+                is_self_closing=True,
+                is_fragment=False,
+                kid=self.flat_cur_nodes,
+            )
+
+        def jsx_opening_closing(self, _: None) -> uni.JsxElement:
+            """Grammar rule.
+
+            jsx_opening_closing: jsx_opening_element jsx_children? jsx_closing_element
+            """
+            opening = self.consume(uni.JsxElement)  # From jsx_opening_element
+            # jsx_children is optional and returns a list when present
+            children_list = self.match(
+                list
+            )  # Will match jsx_children which returns a list
+            children = children_list if children_list else []
+            self.consume(uni.JsxElement)  # From jsx_closing_element (closing tag)
+
+            # Merge opening and closing into single element
+            return uni.JsxElement(
+                name=opening.name,
+                attributes=opening.attributes,
+                children=children if children else None,
+                is_self_closing=False,
+                is_fragment=False,
+                kid=self.flat_cur_nodes,
+            )
+
+        def jsx_fragment(self, _: None) -> uni.JsxElement:
+            """Grammar rule.
+
+            jsx_fragment: JSX_FRAG_OPEN jsx_children? JSX_FRAG_CLOSE
+            """
+            self.consume_token(Tok.JSX_FRAG_OPEN)
+            # jsx_children is optional and returns a list when present
+            children_list = self.match(
+                list
+            )  # Will match jsx_children which returns a list
+            children = children_list if children_list else []
+            self.consume_token(Tok.JSX_FRAG_CLOSE)
+
+            return uni.JsxElement(
+                name=None,
+                attributes=None,
+                children=children if children else None,
+                is_self_closing=False,
+                is_fragment=True,
+                kid=self.flat_cur_nodes,
+            )
+
+        def jsx_opening_element(self, _: None) -> uni.JsxElement:
+            """Grammar rule.
+
+            jsx_opening_element: JSX_OPEN_START jsx_element_name jsx_attributes? JSX_TAG_END
+            """
+            self.consume_token(Tok.JSX_OPEN_START)
+            name = self.consume(uni.JsxElementName)
+            # jsx_attributes is optional and returns a list when present
+            attrs_list = self.match(
+                list
+            )  # Will match jsx_attributes which returns a list
+            attrs = attrs_list if attrs_list else []
+            self.consume_token(Tok.JSX_TAG_END)
+
+            # Return partial element (will be completed in jsx_opening_closing)
+            return uni.JsxElement(
+                name=name,
+                attributes=attrs,
+                children=None,
+                is_self_closing=False,
+                is_fragment=False,
+                kid=self.flat_cur_nodes,
+            )
+
+        def jsx_closing_element(self, _: None) -> uni.JsxElement:
+            """Grammar rule.
+
+            jsx_closing_element: JSX_CLOSE_START jsx_element_name JSX_TAG_END
+            """
+            self.consume_token(Tok.JSX_CLOSE_START)
+            name = self.consume(uni.JsxElementName)
+            self.consume_token(Tok.JSX_TAG_END)
+            # Return stub element with just closing info
+            return uni.JsxElement(
+                name=name,
+                attributes=None,
+                children=None,
+                is_self_closing=False,
+                is_fragment=False,
+                kid=self.cur_nodes,
+            )
+
+        def jsx_element_name(self, _: None) -> uni.JsxElementName:
+            """Grammar rule.
+
+            jsx_element_name: JSX_NAME (DOT JSX_NAME)*
+            """
+            parts = [self.consume_token(Tok.JSX_NAME)]
+            while self.match_token(Tok.DOT):
+                parts.append(self.consume_token(Tok.JSX_NAME))
+            return uni.JsxElementName(
+                parts=parts,
+                kid=self.cur_nodes,
+            )
+
+        def jsx_attributes(self, _: None) -> list[uni.JsxAttribute]:
+            """Grammar rule.
+
+            jsx_attributes: jsx_attribute+
+            """
+            return self.consume_many(uni.JsxAttribute)
+
+        def jsx_attribute(self, _: None) -> uni.JsxAttribute:
+            """Grammar rule.
+
+            jsx_attribute: jsx_spread_attribute | jsx_normal_attribute
+            """
+            return self.consume(uni.JsxAttribute)
+
+        def jsx_spread_attribute(self, _: None) -> uni.JsxSpreadAttribute:
+            """Grammar rule.
+
+            jsx_spread_attribute: LBRACE ELLIPSIS expression RBRACE
+            """
+            self.consume_token(Tok.LBRACE)
+            self.consume_token(Tok.ELLIPSIS)
+            expr = self.consume(uni.Expr)
+            self.consume_token(Tok.RBRACE)
+            return uni.JsxSpreadAttribute(
+                expr=expr,
+                kid=self.cur_nodes,
+            )
+
+        def jsx_normal_attribute(self, _: None) -> uni.JsxNormalAttribute:
+            """Grammar rule.
+
+            jsx_normal_attribute: JSX_NAME (EQ jsx_attr_value)?
+            """
+            name = self.consume_token(Tok.JSX_NAME)
+            value = None
+            if self.match_token(Tok.EQ):
+                value = self.consume(uni.Expr)
+            return uni.JsxNormalAttribute(
+                name=name,
+                value=value,
+                kid=self.cur_nodes,
+            )
+
+        def jsx_attr_value(self, _: None) -> uni.String | uni.Expr:
+            """Grammar rule.
+
+            jsx_attr_value: STRING | LBRACE expression RBRACE
+            """
+            if string := self.match(uni.String):
+                return string
+            self.consume_token(Tok.LBRACE)
+            expr = self.consume(uni.Expr)
+            self.consume_token(Tok.RBRACE)
+            return expr
+
+        def jsx_children(self, _: None) -> list[uni.JsxChild]:
+            """Grammar rule.
+
+            jsx_children: jsx_child+
+            """
+            # The grammar already produces a list of children
+            # Just collect all JsxChild nodes from cur_nodes
+            children = []
+            while self.node_idx < len(self.cur_nodes):
+                if isinstance(
+                    self.cur_nodes[self.node_idx], (uni.JsxChild, uni.JsxElement)
+                ):
+                    children.append(self.cur_nodes[self.node_idx])  # type: ignore[arg-type]
+                    self.node_idx += 1
+                else:
+                    break
+            return children
+
+        def jsx_child(self, _: None) -> uni.JsxChild:
+            """Grammar rule.
+
+            jsx_child: jsx_element | jsx_expression
+            """
+            if jsx_elem := self.match(uni.JsxElement):
+                return jsx_elem  # type: ignore[return-value]
+            return self.consume(uni.JsxChild)
+
+        def jsx_expression(self, _: None) -> uni.JsxExpression:
+            """Grammar rule.
+
+            jsx_expression: LBRACE expression RBRACE
+            """
+            self.consume_token(Tok.LBRACE)
+            expr = self.consume(uni.Expr)
+            self.consume_token(Tok.RBRACE)
+            return uni.JsxExpression(
+                expr=expr,
+                kid=self.cur_nodes,
+            )
+
+        def jsx_text(self, _: None) -> uni.JsxText:
+            """Grammar rule.
+
+            jsx_text: JSX_TEXT
+            """
+            text = self.consume_token(Tok.JSX_TEXT)
+            return uni.JsxText(
+                value=text,
+                kid=self.cur_nodes,
+            )
+
         def edge_ref_chain(self, _: None) -> uni.EdgeRefTrailer:
             """Grammar rule.
 
@@ -3163,15 +3546,23 @@ class JacParser(Transform[uni.Source, uni.Module]):
                 ret_type = uni.Int
             elif token.type in [
                 Tok.STRING,
-                Tok.FSTR_BESC,
-                Tok.FSTR_PIECE,
-                Tok.FSTR_SQ_PIECE,
-                Tok.FSTR_TRIPLE_PIECE,
-                Tok.FSTR_SQ_TRIPLE_PIECE,
+                Tok.D_LBRACE,
+                Tok.D_RBRACE,
+                Tok.F_TEXT_DQ,
+                Tok.F_TEXT_SQ,
+                Tok.F_TEXT_TDQ,
+                Tok.F_TEXT_TSQ,
+                Tok.RF_TEXT_DQ,
+                Tok.RF_TEXT_SQ,
+                Tok.RF_TEXT_TDQ,
+                Tok.RF_TEXT_TSQ,
+                Tok.F_FORMAT_TEXT,
             ]:
                 ret_type = uni.String
-                if token.type == Tok.FSTR_BESC:
-                    token.value = token.value[1:]
+                if token.type == Tok.D_LBRACE:
+                    token.value = "{"
+                elif token.type == Tok.D_RBRACE:
+                    token.value = "}"
             elif token.type == Tok.BOOL:
                 ret_type = uni.Bool
             elif token.type == Tok.PYNLINE and isinstance(token.value, str):