llparse 0.1.8__tar.gz → 0.2.0__tar.gz

{llparse-0.1.8 → llparse-0.2.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: llparse
-Version: 0.1.8
+Version: 0.2.0
 Summary: A Parody of llparse written for writing C Parsers with Python
 Author-email: Vizonex <VizonexBusiness@gmail.com>
 Requires-Python: >=3.9
@@ -15,15 +15,16 @@ Dynamic: license-file
 
 A python parody of the typescript library llparse.
 
-I take no credit for the orginal work done by indutny and the other node-js contributors involved and I was originally very nervous about making 
-this python library that I made public... 
+I take no credit for the orginal work done by indutny and the other node-js contributors involved and my additional 
+features were meant to inspire activity with the original library again.
 
 Links to the original library 
 - https://llparse.org
 - https://github.com/nodejs/llparse
 
 Unlike the typescript library all 3 of llparse's libraries were combined in this version of the code for the sake of portability... 
-I ended up mentioning how I did this a while back and I also had a concept for a C parser as well but I just didn't like it and I ended up using this instead but I also learned typescript as a bonus and It was alot of fun for me. I don't plan to make this into a real pypi library yet but I also didn't want to take away from the magic of the original source code that I borrowed from...
+I ended up mentioning how I did this a while back and I also had a concept for a C parser as well but I just didn't like it and I ended up using this instead but I also learned typescript as a bonus and It was alot of fun for me. I don't plan to make this into a real pypi library yet but I also didn't want to take away from the magic of the original source code that I borrowed from.
+
 
 # Looking back on my dead work 2 years later
 I had this idea lay somewhat dormant for 2 years and now seeing that I wanted to write a new socks5 server parser writing it in python
@@ -134,3 +135,9 @@ open("http_parser.h", "w").write(c.header)
 
 ## Video Showcasing this library
 - https://youtu.be/YQOzJ2BghQw
+
+## Examples of this library being in use
+- [llh2](https://github.com/Vizonex/llh2) I would like to move to the typescript version once my ideas and
+  features I've added in get fully implemented but we shall wait and see...
+
+

{llparse-0.1.8 → llparse-0.2.0}/README.md

@@ -5,15 +5,16 @@
 
 A python parody of the typescript library llparse.
 
-I take no credit for the orginal work done by indutny and the other node-js contributors involved and I was originally very nervous about making 
-this python library that I made public... 
+I take no credit for the orginal work done by indutny and the other node-js contributors involved and my additional 
+features were meant to inspire activity with the original library again.
 
 Links to the original library 
 - https://llparse.org
 - https://github.com/nodejs/llparse
 
 Unlike the typescript library all 3 of llparse's libraries were combined in this version of the code for the sake of portability... 
-I ended up mentioning how I did this a while back and I also had a concept for a C parser as well but I just didn't like it and I ended up using this instead but I also learned typescript as a bonus and It was alot of fun for me. I don't plan to make this into a real pypi library yet but I also didn't want to take away from the magic of the original source code that I borrowed from...
+I ended up mentioning how I did this a while back and I also had a concept for a C parser as well but I just didn't like it and I ended up using this instead but I also learned typescript as a bonus and It was alot of fun for me. I don't plan to make this into a real pypi library yet but I also didn't want to take away from the magic of the original source code that I borrowed from.
+
 
 # Looking back on my dead work 2 years later
 I had this idea lay somewhat dormant for 2 years and now seeing that I wanted to write a new socks5 server parser writing it in python
@@ -124,3 +125,9 @@ open("http_parser.h", "w").write(c.header)
 
 ## Video Showcasing this library
 - https://youtu.be/YQOzJ2BghQw
+
+## Examples of this library being in use
+- [llh2](https://github.com/Vizonex/llh2) I would like to move to the typescript version once my ideas and
+  features I've added in get fully implemented but we shall wait and see...
+
+

{llparse-0.1.8 → llparse-0.2.0}/llparse/C_compiler.py

@@ -176,13 +176,13 @@ class CCompiler:
             posField = ctx.spanPosField(span.index)
 
             if len(span.callbacks) == 1:
-                cb = ctx.unwrapCode(span.callbacks[0], True)
+                cb = ctx.unwrapCode(span.callbacks[0])
                 callback = ctx.buildCode(cb)
 
             else:
                 # TODO (Vizonex) Merge lines 139 & 140 together in a future update
                 callback = (
-                    f"(({info.prefix}__span_cb)" + ctx.spanCbField(span.index) + f")"
+                    f"(({info.prefix}__span_cb)" + ctx.spanCbField(span.index) + ")"
                 )
 
             args = [ctx.stateArg(), posField, f"(const char*) {ctx.endPosArg()}"]

{llparse-0.1.8 → llparse-0.2.0}/llparse/__init__.py

@@ -1,2 +1,4 @@
 from .dot import Dot
 from .llparse import LLParse
+
+__all__ = ("Dot", "LLParse")

{llparse-0.1.8 → llparse-0.2.0}/llparse/compilator.py

@@ -273,12 +273,13 @@ class Update(Field):
         out.append(f"{self.field(ctx)} = {self.ref.value};")
         out.append("return 0;")
 
+
 class Operator(Field):
     def __init__(self, ref: _frontend.code.Operator):
         self.ref = ref
-    
+
     def doBuild(self, ctx: "Compilation", out: list[str]):
-        out.append(f'return {self.field(ctx)} {self.ref.op} {self.ref.value};')
+        out.append(f"return {self.field(ctx)} {self.ref.op} {self.ref.value};")
 
 
 @dataclass
@@ -508,7 +509,9 @@ class Pause(Error):
 
         assert self.ref.otherwise
         otherwise = ctx.unwrapNode(self.ref.otherwise.node)
-        out.append(f"{ctx.currentField()} = (void*) (intptr_t) {otherwise.cachedDecel or ('s_n_' + otherwise.ref.id.name)};")
+        out.append(
+            f"{ctx.currentField()} = (void*) (intptr_t) {otherwise.cachedDecel or ('s_n_' + otherwise.ref.id.name)};"
+        )
         out.append(f"return {STATE_ERROR};")
 
 
@@ -519,7 +522,7 @@ class Sequence(Node):
 
     def doBuild(self, out: list[str]):
         ctx = self.compilation
-        # TODO: llparse_match_t could be easily changed around to 
+        # TODO: llparse_match_t could be easily changed around to
         # Something that can't be overlapped with when compiled with other parsers...
         out.append("llparse_match_t match_seq;")
         out.append("")
@@ -617,7 +620,7 @@ class SpanStart(Node):
 
         if len(field.callbacks) > 1:
             cbField = ctx.spanCbField(field.index)
-            callback = ctx.unwrapCode(self.ref.callback, True)
+            callback = ctx.unwrapCode(self.ref.callback)
             out.append(f"{cbField} = {ctx.buildCode(callback)};")
 
         otherwise = self.ref.otherwise
@@ -645,7 +648,7 @@ class SpanEnd(Node):
         out.append(f"{posField} = NULL;")
 
         # Invoke callback
-        callback = ctx.buildCode(ctx.unwrapCode(self.ref.callback, True))
+        callback = ctx.buildCode(ctx.unwrapCode(self.ref.callback))
 
         out.append(f"err = {callback}({ctx.stateArg()}, start, {ctx.posArg()});")
 
@@ -691,11 +694,13 @@ class SpanEnd(Node):
 # 0x800000 I24
 # 0x1000000 U24
 
+
 class Int(Node):
     def __init__(self, ref: _frontend.node.Int):
         super().__init__(ref)
         self.ref = ref
         self.offset = ref.byteOffset
+
     # I'm going to deviate from arthurschreiber's work a bit with indutny's suggestions.
     # we should really be using bitwise operators like rshift and lshift
     @property
@@ -705,11 +710,11 @@ class Int(Node):
     def readInt8(self, out: list[str]) -> None:
         ctx, index = self.pair
         out.append(f"{index} = ((*{ctx.posArg()}) & 0x80);")
-    
+
     def readUInt8(self, out: list[str]) -> None:
         ctx, index = self.pair
         out.append(f"{index} = (*{ctx.posArg()});")
-    
+
     # LITTLE ENDIAN
 
     def readInt16LE(self, out: list[str]) -> None:
@@ -717,7 +722,7 @@ class Int(Node):
         if self.offset == 0:
             out.append(f"{index} = (*{ctx.posArg()});")
         else:
-            # Since BE Belongs to performing << aka left shifts we do >> right shifts 
+            # Since BE Belongs to performing << aka left shifts we do >> right shifts
             out.append(f"{index} = ({index} >> 8) | ((*{ctx.posArg()}) & 0x80);")
 
     def readUInt16LE(self, out: list[str]) -> None:
@@ -742,7 +747,7 @@ class Int(Node):
             out.append(f"{index} = (*{ctx.posArg()});")
         else:
             out.append(f"{index} = ({index} >> 8) | (*{ctx.posArg()});")
- 
+
     def readInt32LE(self, out: list[str]) -> None:
         ctx, index = self.pair
         if self.offset == 0:
@@ -758,17 +763,17 @@ class Int(Node):
             out.append(f"{index} = (*{ctx.posArg()});")
         else:
             out.append(f"{index} = ({index} >> 8) | (*{ctx.posArg()});")
-    
-    # BIG ENDIAN 
-    
+
+    # BIG ENDIAN
+
     def readInt16BE(self, out: list[str]) -> None:
         ctx, index = self.pair
         if self.offset == 0:
             out.append(f"{index} = (*{ctx.posArg()});")
         else:
-            # Since LE Belongs to >> we do "<<" instead 
+            # Since LE Belongs to >> we do "<<" instead
             out.append(f"{index} = ({index} << 8) | ((*{ctx.posArg()}) & 0x80);")
-    
+
     def readUInt16BE(self, out: list[str]) -> None:
         ctx, index = self.pair
         if self.offset == 0:
@@ -791,7 +796,7 @@ class Int(Node):
             out.append(f"{index} = (*{ctx.posArg()});")
         else:
             out.append(f"{index} = ({index} << 8) | (*{ctx.posArg()});")
- 
+
     def readInt32BE(self, out: list[str]) -> None:
         ctx, index = self.pair
         if self.offset == 0:
@@ -807,15 +812,16 @@ class Int(Node):
             out.append(f"{index} = (*{ctx.posArg()});")
         else:
             out.append(f"{index} = ({index} << 8) | (*{ctx.posArg()});")
- 
-        
-    def doBuild(self, out:list[str]):
+
+    def doBuild(self, out: list[str]):
         self.prologue(out)
         # I'm still supporting 3.9 but I plan to drop it's support in favor of match case soon...
         bits = self.ref.bits
-        
-        if self.compilation.getFieldType(self.ref.field) == 'ptr':
-            raise ValueError(f'property {self.ref.field} should not use pointers but it was given \"ptr\"')
+
+        if self.compilation.getFieldType(self.ref.field) == "ptr":
+            raise ValueError(
+                f'property {self.ref.field} should not use pointers but it was given "ptr"'
+            )
 
         if bits == 1:
             self.readInt8(out) if self.ref.signed else self.readUInt8(out)
@@ -835,10 +841,8 @@ class Int(Node):
             else:
                 self.readInt32BE(out) if self.ref.signed else self.readUInt32BE(out)
         # TODO: uint64 & int64
-        
-        self.tailTo(out, self.ref.otherwise.node, self.ref.otherwise.noAdvance, None)
-
 
+        self.tailTo(out, self.ref.otherwise.node, self.ref.otherwise.noAdvance, None)
 
 
 MAX_CHAR = 0xFF
@@ -1117,8 +1121,7 @@ class Compilation:
     def reserveSpans(self, spans: list[_frontend.node.SpanField]):
         for span in spans:
             for callback in span.callbacks:
-                cb = self.unwrapCode(callback)
-                if cb:
+                if cb := self.unwrapCode(callback):
                     self.buildCode(cb)
 
     def debug(self, out: list[str], message: str):
@@ -1193,12 +1196,11 @@ class Compilation:
             raise LookupError(f'Field "{field}" not found')
 
     # Helpers are different since in python we have duck typing - Vizonex
-    def unwrapCode(
-        self, code: IWrap[_frontend.code.Code], allow_continue: bool = False
-    ):
-        if self.CodeContainer.get(code):
+    def unwrapCode(self, code: IWrap[_frontend.code.Code]):
+        if __code := self.CodeContainer.get(code):
             # Give some indication that the element has already been built...
-            return self.CodeContainer[code]
+            # return self.CodeContainer[code]
+            return __code
 
         ref = code.ref
 
@@ -1251,7 +1253,7 @@ class Compilation:
             r = Error(ref)
         elif isinstance(ref, _frontend.node.Invoke):
             r = Invoke(ref)
-        
+
         elif isinstance(ref, _frontend.node.SpanStart):
             r = SpanStart(ref)
 

{llparse-0.1.8 → llparse-0.2.0}/llparse/cython_builder.py

@@ -4,7 +4,7 @@ from contextlib import contextmanager
 from typing import Optional
 
 from .frontend import IFrontendResult
-from .pyfront.front import Match
+from .pyfront.code import Match
 from .pyfront.nodes import Invoke
 
 # Inspired by Cython's Writer

{llparse-0.1.8 → llparse-0.2.0}/llparse/enumerator.py

@@ -1,10 +1,11 @@
-from .pyfront.front import IWrap
+from .pyfront.code import IWrap
 from .pyfront.nodes import Node
 
 
 class Enumerator:
+    # TODO: Remove from staticmethod and make one seperate function
     @staticmethod
-    def getAllNodes(root: IWrap[Node]):
+    def getAllNodes(root: IWrap[Node]) -> list[IWrap[Node]]:
         nodes: set[IWrap[Node]] = set()
         queue: list[IWrap[Node]] = [root]
 

{llparse-0.1.8 → llparse-0.2.0}/llparse/frontend.py

@@ -1,5 +1,5 @@
 from dataclasses import dataclass, field
-from typing import Literal, Optional, Union, TypeVar
+from typing import Literal, Optional, TypeVar, Union
 
 from .enumerator import Enumerator
 from .pybuilder import LoopChecker
@@ -7,12 +7,12 @@ from .pybuilder import builder as source
 
 # from pyfront.namespace import code, node , transform
 from .pyfront import namespace as _frontend
-from .pyfront.front import Identifier, IWrap, SpanField
+from .pyfront.code import Identifier, IWrap, SpanField
 from .pyfront.implementation import IImplementation
 from .pyfront.nodes import ITableEdge
 from .pyfront.peephole import Peephole
 from .spanalloc import SpanAllocator
-from .trie import Trie, TrieEmpty, TrieNode, TrieSequence, TrieSingle, ITrieSingleChild
+from .trie import ITrieSingleChild, Trie, TrieEmpty, TrieNode, TrieSequence, TrieSingle
 
 DEFAULT_MIN_TABLE_SIZE = 32
 DEFAULT_MAX_TABLE_WIDTH = 4
@@ -22,8 +22,8 @@ from logging import getLogger
 log = getLogger("llparse.frontend")
 
 
-CodeT = TypeVar('CodeT', bound=source.code.Code)
-NodeT = TypeVar('NodeT', bound=source.node.Node)
+CodeT = TypeVar("CodeT", bound=source.code.Code)
+NodeT = TypeVar("NodeT", bound=source.node.Node)
 
 WrappedNode = IWrap[_frontend.node.Node]
 WrappedCode = IWrap[_frontend.code.Code]
@@ -196,7 +196,7 @@ class Frontend:
                 _frontend.node.Sequence,
                 _frontend.node.Single,
                 _frontend.node.TableLookup,
-                _frontend.node.SpanStart
+                _frontend.node.SpanStart,
             ),
         ):
             self.resumptionTargets.add(node)
@@ -263,8 +263,8 @@ class Frontend:
 
             assert isinstance(node, (source.code.Match, source.node.Int))
             _match = node
-        
-            assert otherwise, (f'Node "{node.name}" has no ".otherwise()"')
+
+            assert otherwise, f'Node "{node.name}" has no ".otherwise()"'
 
             if isinstance(node, source.node.Match):
                 for child in result:
@@ -277,9 +277,10 @@ class Frontend:
                     # TODO Vizonex : This might break , be sure to make a workaround function here...
                     child.ref.setTransform(transform)
 
-            
             else:
-                result[-1].ref.setOtherwise(self.translate(otherwise.node), otherwise.noAdvance)
+                result[-1].ref.setOtherwise(
+                    self.translate(otherwise.node), otherwise.noAdvance
+                )
             assert len(result) >= 1
             return result[0]
 
@@ -310,16 +311,30 @@ class Frontend:
                 assert len(list(node)) == 0
 
             return single
-        
+
     def translateInt(self, node: source.node.Int) -> list[IWrap[_frontend.node.Int]]:
-        inner = _frontend.node.Int(self.Id.id(node.name), node.field, node.bits, node.signed, node.little_endian, 0)
+        inner = _frontend.node.Int(
+            self.Id.id(node.name),
+            node.field,
+            node.bits,
+            node.signed,
+            node.little_endian,
+            0,
+        )
         result = [self.implementation.node.Int(inner)]
         # front is to avoid overlapping with python's functions (aka next)
         front = self.Map[node] = result[0]
-        
+
         for offset in range(1, node.bits):
             unique_name = self.Id.id(f"{node.name}_byte{offset + 1}")
-            inner = _frontend.node.Int(unique_name, node.field, node.bits, node.signed, node.little_endian, offset)
+            inner = _frontend.node.Int(
+                unique_name,
+                node.field,
+                node.bits,
+                node.signed,
+                node.little_endian,
+                offset,
+            )
             outer = self.implementation.node.Int(inner)
             result.append(outer)
             # Integers will advance since they are unpacking values...
@@ -327,7 +342,6 @@ class Frontend:
             front = result[-1]
         return result
 
-
     def maybeTableLookup(
         self, node: source.code.Match, trie: TrieSingle, children: MatchChildren
     ):
@@ -466,9 +480,7 @@ class Frontend:
     def translateSpanCode(self, code: source.code._Span):
         return self.translateCode(code)
 
-    def translateCode(
-        self, code: CodeT
-    ):
+    def translateCode(self, code: CodeT):
         """Translates Builder Classes to Frontend Classes..."""
 
         prefixed = self.codeId.id(code.name).name
@@ -479,13 +491,13 @@ class Frontend:
             res = codeImpl.IsEqual(
                 _frontend.code.IsEqual(prefixed, code.field, code.value)
             )
-        # custom thing I added in 0.1.6 I encourage the typescript 
+        # custom thing I added in 0.1.6 I encourage the typescript
         # maintainers and developers of llparse to look into this :)
         elif isinstance(code, source.code.Operator):
-            res = codeImpl.Operator(_frontend.code.Operator(
-                prefixed, code.field, code.value, code.op
-            ))
-        
+            res = codeImpl.Operator(
+                _frontend.code.Operator(prefixed, code.field, code.value, code.op)
+            )
+
         elif isinstance(code, source.code.Load):
             res = codeImpl.Load(_frontend.code.Load(prefixed, code.field))
 

{llparse-0.1.8 → llparse-0.2.0}/llparse/llparse.py

@@ -67,21 +67,19 @@ class Compiler:
         properties: list[source.Property],
         header_name: Optional[str] = None,
         Impl: Optional[IImplementation] = IImplementation(),
-        override_llparse_name: bool = False
+        override_llparse_name: bool = False,
     ):
         """Creates the C and header file..."""
         info = self.to_frontend(root, properties, Impl)
         hb = HeaderBuilder(self.prefix, self.headerGuard, properties, info.spans)
-        cdata =  CCompiler(header_name, self.debug).compile(info)
+        cdata = CCompiler(header_name, self.debug).compile(info)
         if override_llparse_name:
             # sometimes users want to combine parsers together when compiling with C
             # to make up for conflicts with other parsers example: llhttp
             # there should be a fair way of compiling everything.
-            cdata = cdata.replace('llparse', self.prefix)
+            cdata = cdata.replace("llparse", self.prefix)
 
-        return CompilerResult(
-           cdata , hb.build()
-        )
+        return CompilerResult(cdata, hb.build())
 
 
 class LLParse(source.Builder):
@@ -113,7 +111,7 @@ class LLParse(source.Builder):
         debug: Optional[str] = None,
         maxTableElemWidth: Optional[int] = None,
         minTableSize: Optional[int] = None,
-    ):
+    ) -> Compiler:
         return Compiler(
             self.prefix,
             headerGuard,
@@ -130,8 +128,8 @@ class LLParse(source.Builder):
         maxTableElemWidth: Optional[int] = None,
         minTableSize: Optional[int] = None,
         header_name: Optional[str] = None,
-        override_llparse_name:bool = False
-    ):
+        override_llparse_name: bool = False,
+    ) -> CompilerResult:
         """Builds Graph and then compiles the data into C code , returns with the header and C file inside of a Dataclass"""
 
         compiler = Compiler(
@@ -142,8 +140,12 @@ class LLParse(source.Builder):
             minTableSize if minTableSize else DEFAULT_MIN_TABLE_SIZE,
         )
 
-        return compiler.compile(root, self.properties(), header_name=header_name, override_llparse_name=override_llparse_name)
-    
+        return compiler.compile(
+            root,
+            self.properties(),
+            header_name=header_name,
+            override_llparse_name=override_llparse_name,
+        )
 
     def to_frontend(
         self,
@@ -152,7 +154,7 @@ class LLParse(source.Builder):
         debug: Optional[str] = None,
         maxTableElemWidth: Optional[int] = None,
         minTableSize: Optional[int] = None,
-    ):
+    ) -> Compiler:
         """Used as an external hack to get access to the frontend of llparse and extract
         it's contents to compile the libraries you make other things like cython, This is not in llparse
         specifically (Yet...)"""

llparse-0.2.0/llparse/pybuilder/__init__.py

@@ -0,0 +1,7 @@
+from ..pybuilder.builder import *
+from ..pybuilder.loopchecker import *
+from ..pybuilder.main_code import (  # I'll add more soon I feel a little lazy at the moment.
+    Int,
+    Match,
+    Node,
+)

{llparse-0.1.8 → llparse-0.2.0}/llparse/pybuilder/builder.py

@@ -1,10 +1,9 @@
 from typing import Literal, Optional, Union
+
 from ..pybuilder import main_code as code
 
 # typehinting node and code (TODO: Vizonex) Lets seperate the modules soon...
 node = code
-# from pydot import graph_from_dot_data
-
 
 i8 = "i8"
 i16 = "i16"

{llparse-0.1.8 → llparse-0.2.0}/llparse/pybuilder/loopchecker.py

@@ -118,15 +118,14 @@ class Reachability:
     def build(self, root: Node) -> list[Node]:
         res: set[Node] = set()
         queue = [root]
-        while len(queue) != 0:
+        while queue:
             node = queue.pop()
             if node in res:
                 continue
             res.add(node)
             for edge in node:
                 queue.append(edge.node)
-            otherwise = node.getOtherwiseEdge()
-            if otherwise:
+            if otherwise := node.getOtherwiseEdge():
                 queue.append(otherwise.node)
 
         # Reverse the order so that we always

{llparse-0.1.8 → llparse-0.2.0}/llparse/pybuilder/main_code.py

@@ -196,7 +196,6 @@ class Node:
             return res
         else:
             # Concate DO NOT ADD TO RES!!!!
-
             return res + [self.otherwiseEdge]
 
     def __iter__(self):
@@ -601,20 +600,3 @@ class Reachability:
                 queue.append(otherwise.node)
 
         return list(res)
-
-
-# On_User_Key = Match("On_User_Key")
-
-# On_User_Value = Match("On_User_Value")
-
-# data_extraction = Node("On_Data_Extraction").skipTo(On_User_Key)
-
-# node = Match("On_Level_Comment").skipTo(data_extraction)
-
-
-# On_User_Key.match(["0","1","2","3","4","5","6","7","8","9"],On_User_Key)\
-#     .peek("~",On_User_Value)\
-#     .otherwise(Error(1,"[BAD KEY] Some retard decided to hijack your server! Oh SHIT!"))
-
-
-# print([d.node.name for d in node.getAllEdges()])

llparse-0.2.0/llparse/pyfront/__init__.py

@@ -0,0 +1,3 @@
+from . import code as code
+from . import nodes as node
+

llparse-0.1.8/llparse/pyfront/front.py → llparse-0.2.0/llparse/pyfront/code.py

@@ -89,7 +89,11 @@ class IsEqual(FieldValue):
 class Operator(FieldValue):
     def __init__(self, name: str, field: str, value: int, op: str):
         super().__init__(
-            "match", f"is_{field}_{name}_{toCacheKey(value)}", f'{name}_{toCacheKey(value)}', field, value
+            "match",
+            f"is_{field}_{name}_{toCacheKey(value)}",
+            f"{name}_{toCacheKey(value)}",
+            field,
+            value,
         )
         self.op = op
 

{llparse-0.1.8 → llparse-0.2.0}/llparse/pyfront/implementation.py

@@ -1,7 +1,7 @@
-from ..pyfront import front as code
+from . import code as code
 from ..pyfront import nodes as node
 from ..pyfront import transform
-from ..pyfront.front import IWrap
+from .code import IWrap
 
 
 class INodeImplementation:
@@ -37,7 +37,7 @@ class INodeImplementation:
 
     def TableLookup(self, n: node.TableLookup):
         return IWrap(n)
-    
+
     def Int(self, n: node.Int):
         return IWrap(n)
 
@@ -93,7 +93,7 @@ class ICodeImplementation:
 
     def Value(self, c: code.Value):
         return IWrap(c)
-    
+
     def Operator(self, c: code.Operator):
         return IWrap(c)
 

llparse-0.2.0/llparse/pyfront/namespace.py

@@ -0,0 +1,9 @@
+from ..pyfront import transform as transform
+from ..pyfront import nodes as node
+from ..pyfront import code as code
+
+__all__ = (
+    "node",
+    "code",
+    "transform"
+)