Add files using upload-large-folder tool

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.10.0_compressed_pickle_py27_np17.gz

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a1f4e8cccfca94f25ae744d1f050b0734f663263ba38ed0642181404b348b17b
+size 757

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.10.0_compressed_pickle_py34_np19.gz

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1abdb3ff5b555831f51f7ff00951e66a49277fc2aa787293f18cf8775be65023
+size 794

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.10.0_compressed_pickle_py35_np19.gz

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a56c3fc6e0db3a4102aaed4a19fd4e154eecd956f30b6bf9179897844ed3c01e
+size 790

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.10.0_pickle_py27_np17.pkl.bz2

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a18415232322531c918164ae04148ebc258acd3a00fa4529728416755e14a15e
+size 997

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.10.0_pickle_py33_np18.pkl.xz

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0e9a63dcc7df38ab0a1137a9b44b436b13cebfa300eb19dba4ae4bce50d0fa81
+size 752

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.10.0_pickle_py35_np19.pkl

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:97b9ef2e896104321d3c5ce73b3de504788c38f04f08c8b56d7a29d6d1520a96
+size 1068

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.11.0_compressed_pickle_py36_np111.gz

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d56ae75c3a83a0d10f60e657d50e56af6e3addbf2f555e9fc385a6e52e1b32de
+size 800

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.11.0_pickle_py36_np111.pkl.xz

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:dd787f35b3197418d8c7bca77c9dc5ca47b6f22cd24524b3ccd074cf90f893d6
+size 752

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.9.2_compressed_pickle_py35_np19.gz

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9f33bd8a21a41b729b05dac5deeb0e868f218a092b0e3fe5988094cf167217f6
+size 673

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.9.2_pickle_py27_np16.pkl

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:9da8a3764db121e29d21ade67c9c3426598e76d88deae44cd7238983af8cef73
+size 670

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.9.2_pickle_py27_np16.pkl_03.npy

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:a0c45ae2a289841cbeba2443b7ebaa3b31c0a9e9dcc73294aca5729da0092405
+size 236

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.9.2_pickle_py27_np17.pkl_01.npy

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0efbd7d9ce7eec3a6e0a0db41e795e0396cca3d6b037dad6c61b464843d28809
+size 120

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.9.2_pickle_py34_np19.pkl_01.npy

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:0efbd7d9ce7eec3a6e0a0db41e795e0396cca3d6b037dad6c61b464843d28809
+size 120

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.9.2_pickle_py34_np19.pkl_02.npy

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:1c1cf36cb781fbcc21b953bb0a0b45df092da0eae0e765882e5963ccd70105b1
+size 120

env-llmeval/lib/python3.10/site-packages/joblib/test/data/joblib_0.9.2_pickle_py34_np19.pkl_04.npy

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:3ecbe244294ba93e08479b16c1b9a9411e3569ff660ed0459dca1d241381df05
+size 104

env-llmeval/lib/python3.10/site-packages/sympy/parsing/autolev/test-examples/pydy-example-repo/chaos_pendulum.al

@@ -0,0 +1,33 @@
+CONSTANTS G,LB,W,H
+MOTIONVARIABLES' THETA'',PHI'',OMEGA',ALPHA'
+NEWTONIAN N
+BODIES A,B
+SIMPROT(N,A,2,THETA)
+SIMPROT(A,B,3,PHI)
+POINT O
+LA = (LB-H/2)/2
+P_O_AO> = LA*A3>
+P_O_BO> = LB*A3>
+OMEGA = THETA'
+ALPHA = PHI'
+W_A_N> = OMEGA*N2>
+W_B_A> = ALPHA*A3>
+V_O_N> = 0>
+V2PTS(N, A, O, AO)
+V2PTS(N, A, O, BO)
+MASS A=MA, B=MB
+IAXX = 1/12*MA*(2*LA)^2
+IAYY = IAXX
+IAZZ = 0
+IBXX = 1/12*MB*H^2
+IBYY = 1/12*MB*(W^2+H^2)
+IBZZ = 1/12*MB*W^2
+INERTIA A, IAXX, IAYY, IAZZ
+INERTIA B, IBXX, IBYY, IBZZ
+GRAVITY(G*N3>)
+ZERO = FR() + FRSTAR()
+KANE()
+INPUT LB=0.2,H=0.1,W=0.2,MA=0.01,MB=0.1,G=9.81
+INPUT THETA = 90 DEG, PHI = 0.5 DEG, OMEGA=0, ALPHA=0
+INPUT TFINAL=10, INTEGSTP=0.02
+CODE DYNAMICS() some_filename.c

env-llmeval/lib/python3.10/site-packages/sympy/parsing/autolev/test-examples/pydy-example-repo/chaos_pendulum.py

@@ -0,0 +1,55 @@
+import sympy.physics.mechanics as _me
+import sympy as _sm
+import math as m
+import numpy as _np
+
+g, lb, w, h = _sm.symbols('g lb w h', real=True)
+theta, phi, omega, alpha = _me.dynamicsymbols('theta phi omega alpha')
+theta_d, phi_d, omega_d, alpha_d = _me.dynamicsymbols('theta_ phi_ omega_ alpha_', 1)
+theta_dd, phi_dd = _me.dynamicsymbols('theta_ phi_', 2)
+frame_n = _me.ReferenceFrame('n')
+body_a_cm = _me.Point('a_cm')
+body_a_cm.set_vel(frame_n, 0)
+body_a_f = _me.ReferenceFrame('a_f')
+body_a = _me.RigidBody('a', body_a_cm, body_a_f, _sm.symbols('m'), (_me.outer(body_a_f.x,body_a_f.x),body_a_cm))
+body_b_cm = _me.Point('b_cm')
+body_b_cm.set_vel(frame_n, 0)
+body_b_f = _me.ReferenceFrame('b_f')
+body_b = _me.RigidBody('b', body_b_cm, body_b_f, _sm.symbols('m'), (_me.outer(body_b_f.x,body_b_f.x),body_b_cm))
+body_a_f.orient(frame_n, 'Axis', [theta, frame_n.y])
+body_b_f.orient(body_a_f, 'Axis', [phi, body_a_f.z])
+point_o = _me.Point('o')
+la = (lb-h/2)/2
+body_a_cm.set_pos(point_o, la*body_a_f.z)
+body_b_cm.set_pos(point_o, lb*body_a_f.z)
+body_a_f.set_ang_vel(frame_n, omega*frame_n.y)
+body_b_f.set_ang_vel(body_a_f, alpha*body_a_f.z)
+point_o.set_vel(frame_n, 0)
+body_a_cm.v2pt_theory(point_o,frame_n,body_a_f)
+body_b_cm.v2pt_theory(point_o,frame_n,body_a_f)
+ma = _sm.symbols('ma')
+body_a.mass = ma
+mb = _sm.symbols('mb')
+body_b.mass = mb
+iaxx = 1/12*ma*(2*la)**2
+iayy = iaxx
+iazz = 0
+ibxx = 1/12*mb*h**2
+ibyy = 1/12*mb*(w**2+h**2)
+ibzz = 1/12*mb*w**2
+body_a.inertia = (_me.inertia(body_a_f, iaxx, iayy, iazz, 0, 0, 0), body_a_cm)
+body_b.inertia = (_me.inertia(body_b_f, ibxx, ibyy, ibzz, 0, 0, 0), body_b_cm)
+force_a = body_a.mass*(g*frame_n.z)
+force_b = body_b.mass*(g*frame_n.z)
+kd_eqs = [theta_d - omega, phi_d - alpha]
+forceList = [(body_a.masscenter,body_a.mass*(g*frame_n.z)), (body_b.masscenter,body_b.mass*(g*frame_n.z))]
+kane = _me.KanesMethod(frame_n, q_ind=[theta,phi], u_ind=[omega, alpha], kd_eqs = kd_eqs)
+fr, frstar = kane.kanes_equations([body_a, body_b], forceList)
+zero = fr+frstar
+from pydy.system import System
+sys = System(kane, constants = {g:9.81, lb:0.2, w:0.2, h:0.1, ma:0.01, mb:0.1},
+specifieds={},
+initial_conditions={theta:_np.deg2rad(90), phi:_np.deg2rad(0.5), omega:0, alpha:0},
+times = _np.linspace(0.0, 10, 10/0.02))
+
+y=sys.integrate()

env-llmeval/lib/python3.10/site-packages/sympy/parsing/autolev/test-examples/pydy-example-repo/double_pendulum.al

@@ -0,0 +1,25 @@
+MOTIONVARIABLES' Q{2}', U{2}'
+CONSTANTS L,M,G
+NEWTONIAN N
+FRAMES A,B
+SIMPROT(N, A, 3, Q1)
+SIMPROT(N, B, 3, Q2)
+W_A_N>=U1*N3>
+W_B_N>=U2*N3>
+POINT O
+PARTICLES P,R
+P_O_P> = L*A1>
+P_P_R> = L*B1>
+V_O_N> = 0>
+V2PTS(N, A, O, P)
+V2PTS(N, B, P, R)
+MASS P=M, R=M
+Q1' = U1
+Q2' = U2
+GRAVITY(G*N1>)
+ZERO = FR() + FRSTAR()
+KANE()
+INPUT M=1,G=9.81,L=1
+INPUT Q1=.1,Q2=.2,U1=0,U2=0
+INPUT TFINAL=10, INTEGSTP=.01
+CODE DYNAMICS() some_filename.c

env-llmeval/lib/python3.10/site-packages/sympy/parsing/autolev/test-examples/pydy-example-repo/double_pendulum.py

@@ -0,0 +1,39 @@
+import sympy.physics.mechanics as _me
+import sympy as _sm
+import math as m
+import numpy as _np
+
+q1, q2, u1, u2 = _me.dynamicsymbols('q1 q2 u1 u2')
+q1_d, q2_d, u1_d, u2_d = _me.dynamicsymbols('q1_ q2_ u1_ u2_', 1)
+l, m, g = _sm.symbols('l m g', real=True)
+frame_n = _me.ReferenceFrame('n')
+frame_a = _me.ReferenceFrame('a')
+frame_b = _me.ReferenceFrame('b')
+frame_a.orient(frame_n, 'Axis', [q1, frame_n.z])
+frame_b.orient(frame_n, 'Axis', [q2, frame_n.z])
+frame_a.set_ang_vel(frame_n, u1*frame_n.z)
+frame_b.set_ang_vel(frame_n, u2*frame_n.z)
+point_o = _me.Point('o')
+particle_p = _me.Particle('p', _me.Point('p_pt'), _sm.Symbol('m'))
+particle_r = _me.Particle('r', _me.Point('r_pt'), _sm.Symbol('m'))
+particle_p.point.set_pos(point_o, l*frame_a.x)
+particle_r.point.set_pos(particle_p.point, l*frame_b.x)
+point_o.set_vel(frame_n, 0)
+particle_p.point.v2pt_theory(point_o,frame_n,frame_a)
+particle_r.point.v2pt_theory(particle_p.point,frame_n,frame_b)
+particle_p.mass = m
+particle_r.mass = m
+force_p = particle_p.mass*(g*frame_n.x)
+force_r = particle_r.mass*(g*frame_n.x)
+kd_eqs = [q1_d - u1, q2_d - u2]
+forceList = [(particle_p.point,particle_p.mass*(g*frame_n.x)), (particle_r.point,particle_r.mass*(g*frame_n.x))]
+kane = _me.KanesMethod(frame_n, q_ind=[q1,q2], u_ind=[u1, u2], kd_eqs = kd_eqs)
+fr, frstar = kane.kanes_equations([particle_p, particle_r], forceList)
+zero = fr+frstar
+from pydy.system import System
+sys = System(kane, constants = {l:1, m:1, g:9.81},
+specifieds={},
+initial_conditions={q1:.1, q2:.2, u1:0, u2:0},
+times = _np.linspace(0.0, 10, 10/.01))
+
+y=sys.integrate()

env-llmeval/lib/python3.10/site-packages/sympy/parsing/autolev/test-examples/pydy-example-repo/mass_spring_damper.al

@@ -0,0 +1,19 @@
+CONSTANTS M,K,B,G
+MOTIONVARIABLES' POSITION',SPEED'
+VARIABLES O
+FORCE = O*SIN(T)
+NEWTONIAN CEILING
+POINTS ORIGIN
+V_ORIGIN_CEILING> = 0>
+PARTICLES BLOCK
+P_ORIGIN_BLOCK> = POSITION*CEILING1>
+MASS BLOCK=M
+V_BLOCK_CEILING>=SPEED*CEILING1>
+POSITION' = SPEED
+FORCE_MAGNITUDE = M*G-K*POSITION-B*SPEED+FORCE
+FORCE_BLOCK>=EXPLICIT(FORCE_MAGNITUDE*CEILING1>)
+ZERO = FR() + FRSTAR()
+KANE()
+INPUT TFINAL=10.0, INTEGSTP=0.01
+INPUT M=1.0, K=1.0, B=0.2, G=9.8, POSITION=0.1, SPEED=-1.0, O=2
+CODE DYNAMICS() dummy_file.c

env-llmeval/lib/python3.10/site-packages/sympy/parsing/autolev/test-examples/pydy-example-repo/mass_spring_damper.py

@@ -0,0 +1,31 @@
+import sympy.physics.mechanics as _me
+import sympy as _sm
+import math as m
+import numpy as _np
+
+m, k, b, g = _sm.symbols('m k b g', real=True)
+position, speed = _me.dynamicsymbols('position speed')
+position_d, speed_d = _me.dynamicsymbols('position_ speed_', 1)
+o = _me.dynamicsymbols('o')
+force = o*_sm.sin(_me.dynamicsymbols._t)
+frame_ceiling = _me.ReferenceFrame('ceiling')
+point_origin = _me.Point('origin')
+point_origin.set_vel(frame_ceiling, 0)
+particle_block = _me.Particle('block', _me.Point('block_pt'), _sm.Symbol('m'))
+particle_block.point.set_pos(point_origin, position*frame_ceiling.x)
+particle_block.mass = m
+particle_block.point.set_vel(frame_ceiling, speed*frame_ceiling.x)
+force_magnitude = m*g-k*position-b*speed+force
+force_block = (force_magnitude*frame_ceiling.x).subs({position_d:speed})
+kd_eqs = [position_d - speed]
+forceList = [(particle_block.point,(force_magnitude*frame_ceiling.x).subs({position_d:speed}))]
+kane = _me.KanesMethod(frame_ceiling, q_ind=[position], u_ind=[speed], kd_eqs = kd_eqs)
+fr, frstar = kane.kanes_equations([particle_block], forceList)
+zero = fr+frstar
+from pydy.system import System
+sys = System(kane, constants = {m:1.0, k:1.0, b:0.2, g:9.8},
+specifieds={_me.dynamicsymbols('t'):lambda x, t: t, o:2},
+initial_conditions={position:0.1, speed:-1*1.0},
+times = _np.linspace(0.0, 10.0, 10.0/0.01))
+
+y=sys.integrate()

env-llmeval/lib/python3.10/site-packages/sympy/parsing/autolev/test-examples/pydy-example-repo/non_min_pendulum.al

@@ -0,0 +1,20 @@
+MOTIONVARIABLES' Q{2}''
+CONSTANTS L,M,G
+NEWTONIAN N
+POINT PN
+V_PN_N> = 0>
+THETA1 = ATAN(Q2/Q1)
+FRAMES A
+SIMPROT(N, A, 3, THETA1)
+PARTICLES P
+P_PN_P> = Q1*N1>+Q2*N2>
+MASS P=M
+V_P_N>=DT(P_P_PN>, N)
+F_V = DOT(EXPRESS(V_P_N>,A), A1>)
+GRAVITY(G*N1>)
+DEPENDENT[1] = F_V
+CONSTRAIN(DEPENDENT[Q1'])
+ZERO=FR()+FRSTAR()
+F_C = MAG(P_P_PN>)-L
+CONFIG[1]=F_C
+ZERO[2]=CONFIG[1]

env-llmeval/lib/python3.10/site-packages/sympy/parsing/autolev/test-examples/pydy-example-repo/non_min_pendulum.py

@@ -0,0 +1,36 @@
+import sympy.physics.mechanics as _me
+import sympy as _sm
+import math as m
+import numpy as _np
+
+q1, q2 = _me.dynamicsymbols('q1 q2')
+q1_d, q2_d = _me.dynamicsymbols('q1_ q2_', 1)
+q1_dd, q2_dd = _me.dynamicsymbols('q1_ q2_', 2)
+l, m, g = _sm.symbols('l m g', real=True)
+frame_n = _me.ReferenceFrame('n')
+point_pn = _me.Point('pn')
+point_pn.set_vel(frame_n, 0)
+theta1 = _sm.atan(q2/q1)
+frame_a = _me.ReferenceFrame('a')
+frame_a.orient(frame_n, 'Axis', [theta1, frame_n.z])
+particle_p = _me.Particle('p', _me.Point('p_pt'), _sm.Symbol('m'))
+particle_p.point.set_pos(point_pn, q1*frame_n.x+q2*frame_n.y)
+particle_p.mass = m
+particle_p.point.set_vel(frame_n, (point_pn.pos_from(particle_p.point)).dt(frame_n))
+f_v = _me.dot((particle_p.point.vel(frame_n)).express(frame_a), frame_a.x)
+force_p = particle_p.mass*(g*frame_n.x)
+dependent = _sm.Matrix([[0]])
+dependent[0] = f_v
+velocity_constraints = [i for i in dependent]
+u_q1_d = _me.dynamicsymbols('u_q1_d')
+u_q2_d = _me.dynamicsymbols('u_q2_d')
+kd_eqs = [q1_d-u_q1_d, q2_d-u_q2_d]
+forceList = [(particle_p.point,particle_p.mass*(g*frame_n.x))]
+kane = _me.KanesMethod(frame_n, q_ind=[q1,q2], u_ind=[u_q2_d], u_dependent=[u_q1_d], kd_eqs = kd_eqs, velocity_constraints = velocity_constraints)
+fr, frstar = kane.kanes_equations([particle_p], forceList)
+zero = fr+frstar
+f_c = point_pn.pos_from(particle_p.point).magnitude()-l
+config = _sm.Matrix([[0]])
+config[0] = f_c
+zero = zero.row_insert(zero.shape[0], _sm.Matrix([[0]]))
+zero[zero.shape[0]-1] = config[0]

env-llmeval/lib/python3.10/site-packages/sympy/parsing/c/__init__.py

@@ -0,0 +1 @@
+"""Used for translating C source code into a SymPy expression"""

env-llmeval/lib/python3.10/site-packages/sympy/parsing/c/c_parser.py

@@ -0,0 +1,1090 @@
+from sympy.external import import_module
+import os
+
+cin = import_module('clang.cindex', import_kwargs = {'fromlist': ['cindex']})
+
+"""
+This module contains all the necessary Classes and Function used to Parse C and
+C++ code into SymPy expression
+The module serves as a backend for SymPyExpression to parse C code
+It is also dependent on Clang's AST and SymPy's Codegen AST.
+The module only supports the features currently supported by the Clang and
+codegen AST which will be updated as the development of codegen AST and this
+module progresses.
+You might find unexpected bugs and exceptions while using the module, feel free
+to report them to the SymPy Issue Tracker
+
+Features Supported
+==================
+
+- Variable Declarations (integers and reals)
+- Assignment (using integer & floating literal and function calls)
+- Function Definitions and Declaration
+- Function Calls
+- Compound statements, Return statements
+
+Notes
+=====
+
+The module is dependent on an external dependency which needs to be installed
+to use the features of this module.
+
+Clang: The C and C++ compiler which is used to extract an AST from the provided
+C source code.
+
+References
+==========
+
+.. [1] https://github.com/sympy/sympy/issues
+.. [2] https://clang.llvm.org/docs/
+.. [3] https://clang.llvm.org/docs/IntroductionToTheClangAST.html
+
+"""
+
+if cin:
+    from sympy.codegen.ast import (Variable, Integer, Float,
+        FunctionPrototype, FunctionDefinition, FunctionCall,
+        none, Return, Assignment, intc, int8, int16, int64,
+        uint8, uint16, uint32, uint64, float32, float64, float80,
+        aug_assign, bool_, While, CodeBlock)
+    from sympy.codegen.cnodes import (PreDecrement, PostDecrement,
+        PreIncrement, PostIncrement)
+    from sympy.core import Add, Mod, Mul, Pow, Rel
+    from sympy.logic.boolalg import And, as_Boolean, Not, Or
+    from sympy.core.symbol import Symbol
+    from sympy.core.sympify import sympify
+    from sympy.logic.boolalg import (false, true)
+    import sys
+    import tempfile
+
+    class BaseParser:
+        """Base Class for the C parser"""
+
+        def __init__(self):
+            """Initializes the Base parser creating a Clang AST index"""
+            self.index = cin.Index.create()
+
+        def diagnostics(self, out):
+            """Diagostics function for the Clang AST"""
+            for diag in self.tu.diagnostics:
+                print('%s %s (line %s, col %s) %s' % (
+                        {
+                            4: 'FATAL',
+                            3: 'ERROR',
+                            2: 'WARNING',
+                            1: 'NOTE',
+                            0: 'IGNORED',
+                        }[diag.severity],
+                        diag.location.file,
+                        diag.location.line,
+                        diag.location.column,
+                        diag.spelling
+                    ), file=out)
+
+    class CCodeConverter(BaseParser):
+        """The Code Convereter for Clang AST
+
+        The converter object takes the C source code or file as input and
+        converts them to SymPy Expressions.
+        """
+
+        def __init__(self):
+            """Initializes the code converter"""
+            super().__init__()
+            self._py_nodes = []
+            self._data_types = {
+                "void": {
+                    cin.TypeKind.VOID: none
+                },
+                "bool": {
+                    cin.TypeKind.BOOL: bool_
+                },
+                "int": {
+                    cin.TypeKind.SCHAR: int8,
+                    cin.TypeKind.SHORT: int16,
+                    cin.TypeKind.INT: intc,
+                    cin.TypeKind.LONG: int64,
+                    cin.TypeKind.UCHAR: uint8,
+                    cin.TypeKind.USHORT: uint16,
+                    cin.TypeKind.UINT: uint32,
+                    cin.TypeKind.ULONG: uint64
+                },
+                "float": {
+                    cin.TypeKind.FLOAT: float32,
+                    cin.TypeKind.DOUBLE: float64,
+                    cin.TypeKind.LONGDOUBLE: float80
+                }
+            }
+
+        def parse(self, filenames, flags):
+            """Function to parse a file with C source code
+
+            It takes the filename as an attribute and creates a Clang AST
+            Translation Unit parsing the file.
+            Then the transformation function is called on the translation unit,
+            whose reults are collected into a list which is returned by the
+            function.
+
+            Parameters
+            ==========
+
+            filenames : string
+                Path to the C file to be parsed
+
+            flags: list
+                Arguments to be passed to Clang while parsing the C code
+
+            Returns
+            =======
+
+            py_nodes: list
+                A list of SymPy AST nodes
+
+            """
+            filename = os.path.abspath(filenames)
+            self.tu = self.index.parse(
+                filename,
+                args=flags,
+                options=cin.TranslationUnit.PARSE_DETAILED_PROCESSING_RECORD
+            )
+            for child in self.tu.cursor.get_children():
+                if child.kind == cin.CursorKind.VAR_DECL:
+                    self._py_nodes.append(self.transform(child))
+                elif (child.kind == cin.CursorKind.FUNCTION_DECL):
+                    self._py_nodes.append(self.transform(child))
+                else:
+                    pass
+            return self._py_nodes
+
+        def parse_str(self, source, flags):
+            """Function to parse a string with C source code
+
+            It takes the source code as an attribute, stores it in a temporary
+            file and creates a Clang AST Translation Unit parsing the file.
+            Then the transformation function is called on the translation unit,
+            whose reults are collected into a list which is returned by the
+            function.
+
+            Parameters
+            ==========
+
+            source : string
+                Path to the C file to be parsed
+
+            flags: list
+                Arguments to be passed to Clang while parsing the C code
+
+            Returns
+            =======
+
+            py_nodes: list
+                A list of SymPy AST nodes
+
+            """
+            file = tempfile.NamedTemporaryFile(mode = 'w+', suffix = '.cpp')
+            file.write(source)
+            file.seek(0)
+            self.tu = self.index.parse(
+                file.name,
+                args=flags,
+                options=cin.TranslationUnit.PARSE_DETAILED_PROCESSING_RECORD
+            )
+            file.close()
+            for child in self.tu.cursor.get_children():
+                if child.kind == cin.CursorKind.VAR_DECL:
+                    self._py_nodes.append(self.transform(child))
+                elif (child.kind == cin.CursorKind.FUNCTION_DECL):
+                    self._py_nodes.append(self.transform(child))
+                else:
+                    pass
+            return self._py_nodes
+
+        def transform(self, node):
+            """Transformation Function for Clang AST nodes
+
+            It determines the kind of node and calls the respective
+            transformation function for that node.
+
+            Raises
+            ======
+
+            NotImplementedError : if the transformation for the provided node
+            is not implemented
+
+            """
+            try:
+                handler = getattr(self, 'transform_%s' % node.kind.name.lower())
+            except AttributeError:
+                print(
+                    "Ignoring node of type %s (%s)" % (
+                        node.kind,
+                        ' '.join(
+                            t.spelling for t in node.get_tokens())
+                        ),
+                    file=sys.stderr
+                )
+                handler = None
+            if handler:
+                result = handler(node)
+                return result
+
+        def transform_var_decl(self, node):
+            """Transformation Function for Variable Declaration
+
+            Used to create nodes for variable declarations and assignments with
+            values or function call for the respective nodes in the clang AST
+
+            Returns
+            =======
+
+            A variable node as Declaration, with the initial value if given
+
+            Raises
+            ======
+
+            NotImplementedError : if called for data types not currently
+            implemented
+
+            Notes
+            =====
+
+            The function currently supports following data types:
+
+            Boolean:
+                bool, _Bool
+
+            Integer:
+                8-bit: signed char and unsigned char
+                16-bit: short, short int, signed short,
+                    signed short int, unsigned short, unsigned short int
+                32-bit: int, signed int, unsigned int
+                64-bit: long, long int, signed long,
+                    signed long int, unsigned long, unsigned long int
+
+            Floating point:
+                Single Precision: float
+                Double Precision: double
+                Extended Precision: long double
+
+            """
+            if node.type.kind in self._data_types["int"]:
+                type = self._data_types["int"][node.type.kind]
+            elif node.type.kind in self._data_types["float"]:
+                type = self._data_types["float"][node.type.kind]
+            elif node.type.kind in self._data_types["bool"]:
+                type = self._data_types["bool"][node.type.kind]
+            else:
+                raise NotImplementedError("Only bool, int "
+                    "and float are supported")
+            try:
+                children = node.get_children()
+                child = next(children)
+                #ignoring namespace and type details for the variable
+                while child.kind == cin.CursorKind.NAMESPACE_REF:
+                    child = next(children)
+
+                while child.kind == cin.CursorKind.TYPE_REF:
+                    child = next(children)
+
+                val = self.transform(child)
+
+                supported_rhs = [
+                    cin.CursorKind.INTEGER_LITERAL,
+                    cin.CursorKind.FLOATING_LITERAL,
+                    cin.CursorKind.UNEXPOSED_EXPR,
+                    cin.CursorKind.BINARY_OPERATOR,
+                    cin.CursorKind.PAREN_EXPR,
+                    cin.CursorKind.UNARY_OPERATOR,
+                    cin.CursorKind.CXX_BOOL_LITERAL_EXPR
+                ]
+
+                if child.kind in supported_rhs:
+                    if isinstance(val, str):
+                        value = Symbol(val)
+                    elif isinstance(val, bool):
+                        if node.type.kind in self._data_types["int"]:
+                            value = Integer(0) if val == False else Integer(1)
+                        elif node.type.kind in self._data_types["float"]:
+                            value = Float(0.0) if val == False else Float(1.0)
+                        elif node.type.kind in self._data_types["bool"]:
+                            value = sympify(val)
+                    elif isinstance(val, (Integer, int, Float, float)):
+                        if node.type.kind in self._data_types["int"]:
+                            value = Integer(val)
+                        elif node.type.kind in self._data_types["float"]:
+                            value = Float(val)
+                        elif node.type.kind in self._data_types["bool"]:
+                            value = sympify(bool(val))
+                    else:
+                        value = val
+
+                    return Variable(
+                    node.spelling
+                    ).as_Declaration(
+                        type = type,
+                        value = value
+                    )
+
+                elif child.kind == cin.CursorKind.CALL_EXPR:
+                    return Variable(
+                        node.spelling
+                        ).as_Declaration(
+                            value = val
+                        )
+
+                else:
+                    raise NotImplementedError("Given "
+                        "variable declaration \"{}\" "
+                        "is not possible to parse yet!"
+                        .format(" ".join(
+                            t.spelling for t in node.get_tokens()
+                            )
+                        ))
+
+            except StopIteration:
+                return Variable(
+                node.spelling
+                ).as_Declaration(
+                    type = type
+                )
+
+        def transform_function_decl(self, node):
+            """Transformation Function For Function Declaration
+
+            Used to create nodes for function declarations and definitions for
+            the respective nodes in the clang AST
+
+            Returns
+            =======
+
+            function : Codegen AST node
+                - FunctionPrototype node if function body is not present
+                - FunctionDefinition node if the function body is present
+
+
+            """
+
+            if node.result_type.kind in self._data_types["int"]:
+                ret_type = self._data_types["int"][node.result_type.kind]
+            elif node.result_type.kind in self._data_types["float"]:
+                ret_type = self._data_types["float"][node.result_type.kind]
+            elif node.result_type.kind in self._data_types["bool"]:
+                ret_type = self._data_types["bool"][node.result_type.kind]
+            elif node.result_type.kind in self._data_types["void"]:
+                ret_type = self._data_types["void"][node.result_type.kind]
+            else:
+                raise NotImplementedError("Only void, bool, int "
+                    "and float are supported")
+            body = []
+            param = []
+            try:
+                children = node.get_children()
+                child = next(children)
+
+                # If the node has any children, the first children will be the
+                # return type and namespace for the function declaration. These
+                # nodes can be ignored.
+                while child.kind == cin.CursorKind.NAMESPACE_REF:
+                    child = next(children)
+
+                while child.kind == cin.CursorKind.TYPE_REF:
+                    child = next(children)
+
+
+                # Subsequent nodes will be the parameters for the function.
+                try:
+                    while True:
+                        decl = self.transform(child)
+                        if (child.kind == cin.CursorKind.PARM_DECL):
+                            param.append(decl)
+                        elif (child.kind == cin.CursorKind.COMPOUND_STMT):
+                            for val in decl:
+                                body.append(val)
+                        else:
+                            body.append(decl)
+                        child = next(children)
+                except StopIteration:
+                    pass
+            except StopIteration:
+                pass
+
+            if body == []:
+                function = FunctionPrototype(
+                    return_type = ret_type,
+                    name = node.spelling,
+                    parameters = param
+                )
+            else:
+                function = FunctionDefinition(
+                    return_type = ret_type,
+                    name = node.spelling,
+                    parameters = param,
+                    body = body
+                )
+            return function
+
+        def transform_parm_decl(self, node):
+            """Transformation function for Parameter Declaration
+
+            Used to create parameter nodes for the required functions for the
+            respective nodes in the clang AST
+
+            Returns
+            =======
+
+            param : Codegen AST Node
+                Variable node with the value and type of the variable
+
+            Raises
+            ======
+
+            ValueError if multiple children encountered in the parameter node
+
+            """
+            if node.type.kind in self._data_types["int"]:
+                type = self._data_types["int"][node.type.kind]
+            elif node.type.kind in self._data_types["float"]:
+                type = self._data_types["float"][node.type.kind]
+            elif node.type.kind in self._data_types["bool"]:
+                type = self._data_types["bool"][node.type.kind]
+            else:
+                raise NotImplementedError("Only bool, int "
+                    "and float are supported")
+            try:
+                children = node.get_children()
+                child = next(children)
+
+                # Any namespace nodes can be ignored
+                while child.kind in [cin.CursorKind.NAMESPACE_REF,
+                                     cin.CursorKind.TYPE_REF,
+                                     cin.CursorKind.TEMPLATE_REF]:
+                    child = next(children)
+
+                # If there is a child, it is the default value of the parameter.
+                lit = self.transform(child)
+                if node.type.kind in self._data_types["int"]:
+                    val = Integer(lit)
+                elif node.type.kind in self._data_types["float"]:
+                    val = Float(lit)
+                elif node.type.kind in self._data_types["bool"]:
+                    val = sympify(bool(lit))
+                else:
+                    raise NotImplementedError("Only bool, int "
+                        "and float are supported")
+
+                param = Variable(
+                    node.spelling
+                ).as_Declaration(
+                    type = type,
+                    value = val
+                )
+            except StopIteration:
+                param = Variable(
+                    node.spelling
+                ).as_Declaration(
+                    type = type
+                )
+
+            try:
+                self.transform(next(children))
+                raise ValueError("Can't handle multiple children on parameter")
+            except StopIteration:
+                pass
+
+            return param
+
+        def transform_integer_literal(self, node):
+            """Transformation function for integer literal
+
+            Used to get the value and type of the given integer literal.
+
+            Returns
+            =======
+
+            val : list
+                List with two arguments type and Value
+                type contains the type of the integer
+                value contains the value stored in the variable
+
+            Notes
+            =====
+
+            Only Base Integer type supported for now
+
+            """
+            try:
+                value = next(node.get_tokens()).spelling
+            except StopIteration:
+                # No tokens
+                value = node.literal
+            return int(value)
+
+        def transform_floating_literal(self, node):
+            """Transformation function for floating literal
+
+            Used to get the value and type of the given floating literal.
+
+            Returns
+            =======
+
+            val : list
+                List with two arguments type and Value
+                type contains the type of float
+                value contains the value stored in the variable
+
+            Notes
+            =====
+
+            Only Base Float type supported for now
+
+            """
+            try:
+                value = next(node.get_tokens()).spelling
+            except (StopIteration, ValueError):
+                # No tokens
+                value = node.literal
+            return float(value)
+
+        def transform_string_literal(self, node):
+            #TODO: No string type in AST
+            #type =
+            #try:
+            #    value = next(node.get_tokens()).spelling
+            #except (StopIteration, ValueError):
+                # No tokens
+            #    value = node.literal
+            #val = [type, value]
+            #return val
+            pass
+
+        def transform_character_literal(self, node):
+            """Transformation function for character literal
+
+            Used to get the value of the given character literal.
+
+            Returns
+            =======
+
+            val : int
+                val contains the ascii value of the character literal
+
+            Notes
+            =====
+
+            Only for cases where character is assigned to a integer value,
+            since character literal is not in SymPy AST
+
+            """
+            try:
+               value = next(node.get_tokens()).spelling
+            except (StopIteration, ValueError):
+                # No tokens
+               value = node.literal
+            return ord(str(value[1]))
+
+        def transform_cxx_bool_literal_expr(self, node):
+            """Transformation function for boolean literal
+
+            Used to get the value of the given boolean literal.
+
+            Returns
+            =======
+
+            value : bool
+                value contains the boolean value of the variable
+
+            """
+            try:
+                value = next(node.get_tokens()).spelling
+            except (StopIteration, ValueError):
+                value = node.literal
+            return True if value == 'true' else False
+
+        def transform_unexposed_decl(self,node):
+            """Transformation function for unexposed declarations"""
+            pass
+
+        def transform_unexposed_expr(self, node):
+            """Transformation function for unexposed expression
+
+            Unexposed expressions are used to wrap float, double literals and
+            expressions
+
+            Returns
+            =======
+
+            expr : Codegen AST Node
+                the result from the wrapped expression
+
+            None : NoneType
+                No childs are found for the node
+
+            Raises
+            ======
+
+            ValueError if the expression contains multiple children
+
+            """
+            # Ignore unexposed nodes; pass whatever is the first
+            # (and should be only) child unaltered.
+            try:
+                children = node.get_children()
+                expr = self.transform(next(children))
+            except StopIteration:
+                return None
+
+            try:
+                next(children)
+                raise ValueError("Unexposed expression has > 1 children.")
+            except StopIteration:
+                pass
+
+            return expr
+
+        def transform_decl_ref_expr(self, node):
+            """Returns the name of the declaration reference"""
+            return node.spelling
+
+        def transform_call_expr(self, node):
+            """Transformation function for a call expression
+
+            Used to create function call nodes for the function calls present
+            in the C code
+
+            Returns
+            =======
+
+            FunctionCall : Codegen AST Node
+                FunctionCall node with parameters if any parameters are present
+
+            """
+            param = []
+            children = node.get_children()
+            child = next(children)
+
+            while child.kind == cin.CursorKind.NAMESPACE_REF:
+                child = next(children)
+            while child.kind == cin.CursorKind.TYPE_REF:
+                child = next(children)
+
+            first_child = self.transform(child)
+            try:
+                for child in children:
+                    arg = self.transform(child)
+                    if (child.kind == cin.CursorKind.INTEGER_LITERAL):
+                        param.append(Integer(arg))
+                    elif (child.kind == cin.CursorKind.FLOATING_LITERAL):
+                        param.append(Float(arg))
+                    else:
+                        param.append(arg)
+                return FunctionCall(first_child, param)
+
+            except StopIteration:
+                return FunctionCall(first_child)
+
+        def transform_return_stmt(self, node):
+            """Returns the Return Node for a return statement"""
+            return Return(next(node.get_children()).spelling)
+
+        def transform_compound_stmt(self, node):
+            """Transformation function for compond statemets
+
+            Returns
+            =======
+
+            expr : list
+                list of Nodes for the expressions present in the statement
+
+            None : NoneType
+                if the compound statement is empty
+
+            """
+            try:
+                expr = []
+                children = node.get_children()
+                for child in children:
+                    expr.append(self.transform(child))
+            except StopIteration:
+                return None
+            return expr
+
+        def transform_decl_stmt(self, node):
+            """Transformation function for declaration statements
+
+            These statements are used to wrap different kinds of declararions
+            like variable or function declaration
+            The function calls the transformer function for the child of the
+            given node
+
+            Returns
+            =======
+
+            statement : Codegen AST Node
+                contains the node returned by the children node for the type of
+                declaration
+
+            Raises
+            ======
+
+            ValueError if multiple children present
+
+            """
+            try:
+                children = node.get_children()
+                statement = self.transform(next(children))
+            except StopIteration:
+                pass
+
+            try:
+                self.transform(next(children))
+                raise ValueError("Don't know how to handle multiple statements")
+            except StopIteration:
+                pass
+
+            return statement
+
+        def transform_paren_expr(self, node):
+            """Transformation function for Parenthesized expressions
+
+            Returns the result from its children nodes
+
+            """
+            return self.transform(next(node.get_children()))
+
+        def transform_compound_assignment_operator(self, node):
+            """Transformation function for handling shorthand operators
+
+            Returns
+            =======
+
+            augmented_assignment_expression: Codegen AST node
+                    shorthand assignment expression represented as Codegen AST
+
+            Raises
+            ======
+
+            NotImplementedError
+                If the shorthand operator for bitwise operators
+                (~=, ^=, &=, |=, <<=, >>=) is encountered
+
+            """
+            return self.transform_binary_operator(node)
+
+        def transform_unary_operator(self, node):
+            """Transformation function for handling unary operators
+
+            Returns
+            =======
+
+            unary_expression: Codegen AST node
+                    simplified unary expression represented as Codegen AST
+
+            Raises
+            ======
+
+            NotImplementedError
+                If dereferencing operator(*), address operator(&) or
+                bitwise NOT operator(~) is encountered
+
+            """
+            # supported operators list
+            operators_list = ['+', '-', '++', '--', '!']
+            tokens = list(node.get_tokens())
+
+            # it can be either pre increment/decrement or any other operator from the list
+            if tokens[0].spelling in operators_list:
+                child = self.transform(next(node.get_children()))
+                # (decl_ref) e.g.; int a = ++b; or simply ++b;
+                if isinstance(child, str):
+                    if tokens[0].spelling == '+':
+                        return Symbol(child)
+                    if tokens[0].spelling == '-':
+                        return Mul(Symbol(child), -1)
+                    if tokens[0].spelling == '++':
+                        return PreIncrement(Symbol(child))
+                    if tokens[0].spelling == '--':
+                        return PreDecrement(Symbol(child))
+                    if tokens[0].spelling == '!':
+                        return Not(Symbol(child))
+                # e.g.; int a = -1; or int b = -(1 + 2);
+                else:
+                    if tokens[0].spelling == '+':
+                        return child
+                    if tokens[0].spelling == '-':
+                        return Mul(child, -1)
+                    if tokens[0].spelling == '!':
+                        return Not(sympify(bool(child)))
+
+            # it can be either post increment/decrement
+            # since variable name is obtained in token[0].spelling
+            elif tokens[1].spelling in ['++', '--']:
+                child = self.transform(next(node.get_children()))
+                if tokens[1].spelling == '++':
+                    return PostIncrement(Symbol(child))
+                if tokens[1].spelling == '--':
+                    return PostDecrement(Symbol(child))
+            else:
+                raise NotImplementedError("Dereferencing operator, "
+                    "Address operator and bitwise NOT operator "
+                    "have not been implemented yet!")
+
+        def transform_binary_operator(self, node):
+            """Transformation function for handling binary operators
+
+            Returns
+            =======
+
+            binary_expression: Codegen AST node
+                    simplified binary expression represented as Codegen AST
+
+            Raises
+            ======
+
+            NotImplementedError
+                If a bitwise operator or
+                unary operator(which is a child of any binary
+                operator in Clang AST) is encountered
+
+            """
+            # get all the tokens of assignment
+            # and store it in the tokens list
+            tokens = list(node.get_tokens())
+
+            # supported operators list
+            operators_list = ['+', '-', '*', '/', '%','=',
+            '>', '>=', '<', '<=', '==', '!=', '&&', '||', '+=', '-=',
+            '*=', '/=', '%=']
+
+            # this stack will contain variable content
+            # and type of variable in the rhs
+            combined_variables_stack = []
+
+            # this stack will contain operators
+            # to be processed in the rhs
+            operators_stack = []
+
+            # iterate through every token
+            for token in tokens:
+                # token is either '(', ')' or
+                # any of the supported operators from the operator list
+                if token.kind == cin.TokenKind.PUNCTUATION:
+
+                    # push '(' to the operators stack
+                    if token.spelling == '(':
+                        operators_stack.append('(')
+
+                    elif token.spelling == ')':
+                        # keep adding the expression to the
+                        # combined variables stack unless
+                        # '(' is found
+                        while (operators_stack
+                            and operators_stack[-1] != '('):
+                            if len(combined_variables_stack) < 2:
+                                raise NotImplementedError(
+                                    "Unary operators as a part of "
+                                    "binary operators is not "
+                                    "supported yet!")
+                            rhs = combined_variables_stack.pop()
+                            lhs = combined_variables_stack.pop()
+                            operator = operators_stack.pop()
+                            combined_variables_stack.append(
+                                self.perform_operation(
+                                lhs, rhs, operator))
+
+                        # pop '('
+                        operators_stack.pop()
+
+                    # token is an operator (supported)
+                    elif token.spelling in operators_list:
+                        while (operators_stack
+                            and self.priority_of(token.spelling)
+                            <= self.priority_of(
+                            operators_stack[-1])):
+                            if len(combined_variables_stack) < 2:
+                                raise NotImplementedError(
+                                    "Unary operators as a part of "
+                                    "binary operators is not "
+                                    "supported yet!")
+                            rhs = combined_variables_stack.pop()
+                            lhs = combined_variables_stack.pop()
+                            operator = operators_stack.pop()
+                            combined_variables_stack.append(
+                                self.perform_operation(
+                                lhs, rhs, operator))
+
+                        # push current operator
+                        operators_stack.append(token.spelling)
+
+                    # token is a bitwise operator
+                    elif token.spelling in ['&', '|', '^', '<<', '>>']:
+                        raise NotImplementedError(
+                            "Bitwise operator has not been "
+                            "implemented yet!")
+
+                    # token is a shorthand bitwise operator
+                    elif token.spelling in ['&=', '|=', '^=', '<<=',
+                    '>>=']:
+                        raise NotImplementedError(
+                            "Shorthand bitwise operator has not been "
+                            "implemented yet!")
+                    else:
+                        raise NotImplementedError(
+                            "Given token {} is not implemented yet!"
+                            .format(token.spelling))
+
+                # token is an identifier(variable)
+                elif token.kind == cin.TokenKind.IDENTIFIER:
+                    combined_variables_stack.append(
+                        [token.spelling, 'identifier'])
+
+                # token is a literal
+                elif token.kind == cin.TokenKind.LITERAL:
+                    combined_variables_stack.append(
+                        [token.spelling, 'literal'])
+
+                # token is a keyword, either true or false
+                elif (token.kind == cin.TokenKind.KEYWORD
+                    and token.spelling in ['true', 'false']):
+                    combined_variables_stack.append(
+                        [token.spelling, 'boolean'])
+                else:
+                    raise NotImplementedError(
+                        "Given token {} is not implemented yet!"
+                        .format(token.spelling))
+
+            # process remaining operators
+            while operators_stack:
+                if len(combined_variables_stack) < 2:
+                    raise NotImplementedError(
+                        "Unary operators as a part of "
+                        "binary operators is not "
+                        "supported yet!")
+                rhs = combined_variables_stack.pop()
+                lhs = combined_variables_stack.pop()
+                operator = operators_stack.pop()
+                combined_variables_stack.append(
+                    self.perform_operation(lhs, rhs, operator))
+
+            return combined_variables_stack[-1][0]
+
+        def priority_of(self, op):
+            """To get the priority of given operator"""
+            if op in ['=', '+=', '-=', '*=', '/=', '%=']:
+                return 1
+            if op in ['&&', '||']:
+                return 2
+            if op in ['<', '<=', '>', '>=', '==', '!=']:
+                return 3
+            if op in ['+', '-']:
+                return 4
+            if op in ['*', '/', '%']:
+                return 5
+            return 0
+
+        def perform_operation(self, lhs, rhs, op):
+            """Performs operation supported by the SymPy core
+
+            Returns
+            =======
+
+            combined_variable: list
+                contains variable content and type of variable
+
+            """
+            lhs_value = self.get_expr_for_operand(lhs)
+            rhs_value = self.get_expr_for_operand(rhs)
+            if op == '+':
+                return [Add(lhs_value, rhs_value), 'expr']
+            if op == '-':
+                return [Add(lhs_value, -rhs_value), 'expr']
+            if op == '*':
+                return [Mul(lhs_value, rhs_value), 'expr']
+            if op == '/':
+                return [Mul(lhs_value, Pow(rhs_value, Integer(-1))), 'expr']
+            if op == '%':
+                return [Mod(lhs_value, rhs_value), 'expr']
+            if op in ['<', '<=', '>', '>=', '==', '!=']:
+                return [Rel(lhs_value, rhs_value, op), 'expr']
+            if op == '&&':
+                return [And(as_Boolean(lhs_value), as_Boolean(rhs_value)), 'expr']
+            if op == '||':
+                return [Or(as_Boolean(lhs_value), as_Boolean(rhs_value)), 'expr']
+            if op == '=':
+                return [Assignment(Variable(lhs_value), rhs_value), 'expr']
+            if op in ['+=', '-=', '*=', '/=', '%=']:
+                return [aug_assign(Variable(lhs_value), op[0], rhs_value), 'expr']
+
+        def get_expr_for_operand(self, combined_variable):
+            """Gives out SymPy Codegen AST node
+
+            AST node returned is corresponding to
+            combined variable passed.Combined variable contains
+            variable content and type of variable
+
+            """
+            if combined_variable[1] == 'identifier':
+                return Symbol(combined_variable[0])
+            if combined_variable[1] == 'literal':
+                if '.' in combined_variable[0]:
+                    return Float(float(combined_variable[0]))
+                else:
+                    return Integer(int(combined_variable[0]))
+            if combined_variable[1] == 'expr':
+                return combined_variable[0]
+            if combined_variable[1] == 'boolean':
+                    return true if combined_variable[0] == 'true' else false
+
+        def transform_null_stmt(self, node):
+            """Handles Null Statement and returns None"""
+            return none
+
+        def transform_while_stmt(self, node):
+            """Transformation function for handling while statement
+
+            Returns
+            =======
+
+            while statement : Codegen AST Node
+                contains the while statement node having condition and
+                statement block
+
+            """
+            children = node.get_children()
+
+            condition = self.transform(next(children))
+            statements = self.transform(next(children))
+
+            if isinstance(statements, list):
+                statement_block = CodeBlock(*statements)
+            else:
+                statement_block = CodeBlock(statements)
+
+            return While(condition, statement_block)
+
+
+
+else:
+    class CCodeConverter():  # type: ignore
+        def __init__(self, *args, **kwargs):
+            raise ImportError("Module not Installed")
+
+
+def parse_c(source):
+    """Function for converting a C source code
+
+    The function reads the source code present in the given file and parses it
+    to give out SymPy Expressions
+
+    Returns
+    =======
+
+    src : list
+        List of Python expression strings
+
+    """
+    converter = CCodeConverter()
+    if os.path.exists(source):
+        src = converter.parse(source, flags = [])
+    else:
+        src = converter.parse_str(source, flags = [])
+    return src

env-llmeval/lib/python3.10/site-packages/sympy/parsing/fortran/__init__.py

@@ -0,0 +1 @@
+"""Used for translating Fortran source code into a SymPy expression. """

env-llmeval/lib/python3.10/site-packages/sympy/parsing/fortran/fortran_parser.py

@@ -0,0 +1,347 @@
+from sympy.external import import_module
+
+lfortran = import_module('lfortran')
+
+if lfortran:
+    from sympy.codegen.ast import (Variable, IntBaseType, FloatBaseType, String,
+                                   Return, FunctionDefinition, Assignment)
+    from sympy.core import Add, Mul, Integer, Float
+    from sympy.core.symbol import Symbol
+
+    asr_mod = lfortran.asr
+    asr = lfortran.asr.asr
+    src_to_ast = lfortran.ast.src_to_ast
+    ast_to_asr = lfortran.semantic.ast_to_asr.ast_to_asr
+
+    """
+    This module contains all the necessary Classes and Function used to Parse
+    Fortran code into SymPy expression
+
+    The module and its API are currently under development and experimental.
+    It is also dependent on LFortran for the ASR that is converted to SymPy syntax
+    which is also under development.
+    The module only supports the features currently supported by the LFortran ASR
+    which will be updated as the development of LFortran and this module progresses
+
+    You might find unexpected bugs and exceptions while using the module, feel free
+    to report them to the SymPy Issue Tracker
+
+    The API for the module might also change while in development if better and
+    more effective ways are discovered for the process
+
+    Features Supported
+    ==================
+
+    - Variable Declarations (integers and reals)
+    - Function Definitions
+    - Assignments and Basic Binary Operations
+
+
+    Notes
+    =====
+
+    The module depends on an external dependency
+
+    LFortran : Required to parse Fortran source code into ASR
+
+
+    References
+    ==========
+
+    .. [1] https://github.com/sympy/sympy/issues
+    .. [2] https://gitlab.com/lfortran/lfortran
+    .. [3] https://docs.lfortran.org/
+
+    """
+
+
+    class ASR2PyVisitor(asr.ASTVisitor):  # type: ignore
+        """
+        Visitor Class for LFortran ASR
+
+        It is a Visitor class derived from asr.ASRVisitor which visits all the
+        nodes of the LFortran ASR and creates corresponding AST node for each
+        ASR node
+
+        """
+
+        def __init__(self):
+            """Initialize the Parser"""
+            self._py_ast = []
+
+        def visit_TranslationUnit(self, node):
+            """
+            Function to visit all the elements of the Translation Unit
+            created by LFortran ASR
+            """
+            for s in node.global_scope.symbols:
+                sym = node.global_scope.symbols[s]
+                self.visit(sym)
+            for item in node.items:
+                self.visit(item)
+
+        def visit_Assignment(self, node):
+            """Visitor Function for Assignment
+
+            Visits each Assignment is the LFortran ASR and creates corresponding
+            assignment for SymPy.
+
+            Notes
+            =====
+
+            The function currently only supports variable assignment and binary
+            operation assignments of varying multitudes. Any type of numberS or
+            array is not supported.
+
+            Raises
+            ======
+
+            NotImplementedError() when called for Numeric assignments or Arrays
+
+            """
+            # TODO: Arithmetic Assignment
+            if isinstance(node.target, asr.Variable):
+                target = node.target
+                value = node.value
+                if isinstance(value, asr.Variable):
+                    new_node = Assignment(
+                            Variable(
+                                    target.name
+                                ),
+                            Variable(
+                                    value.name
+                                )
+                        )
+                elif (type(value) == asr.BinOp):
+                    exp_ast = call_visitor(value)
+                    for expr in exp_ast:
+                        new_node = Assignment(
+                                Variable(target.name),
+                                expr
+                            )
+                else:
+                    raise NotImplementedError("Numeric assignments not supported")
+            else:
+                raise NotImplementedError("Arrays not supported")
+            self._py_ast.append(new_node)
+
+        def visit_BinOp(self, node):
+            """Visitor Function for Binary Operations
+
+            Visits each binary operation present in the LFortran ASR like addition,
+            subtraction, multiplication, division and creates the corresponding
+            operation node in SymPy's AST
+
+            In case of more than one binary operations, the function calls the
+            call_visitor() function on the child nodes of the binary operations
+            recursively until all the operations have been processed.
+
+            Notes
+            =====
+
+            The function currently only supports binary operations with Variables
+            or other binary operations. Numerics are not supported as of yet.
+
+            Raises
+            ======
+
+            NotImplementedError() when called for Numeric assignments
+
+            """
+            # TODO: Integer Binary Operations
+            op = node.op
+            lhs = node.left
+            rhs = node.right
+
+            if (type(lhs) == asr.Variable):
+                left_value = Symbol(lhs.name)
+            elif(type(lhs) == asr.BinOp):
+                l_exp_ast = call_visitor(lhs)
+                for exp in l_exp_ast:
+                    left_value = exp
+            else:
+                raise NotImplementedError("Numbers Currently not supported")
+
+            if (type(rhs) == asr.Variable):
+                right_value = Symbol(rhs.name)
+            elif(type(rhs) == asr.BinOp):
+                r_exp_ast = call_visitor(rhs)
+                for exp in r_exp_ast:
+                    right_value = exp
+            else:
+                raise NotImplementedError("Numbers Currently not supported")
+
+            if isinstance(op, asr.Add):
+                new_node = Add(left_value, right_value)
+            elif isinstance(op, asr.Sub):
+                new_node = Add(left_value, -right_value)
+            elif isinstance(op, asr.Div):
+                new_node = Mul(left_value, 1/right_value)
+            elif isinstance(op, asr.Mul):
+                new_node = Mul(left_value, right_value)
+
+            self._py_ast.append(new_node)
+
+        def visit_Variable(self, node):
+            """Visitor Function for Variable Declaration
+
+            Visits each variable declaration present in the ASR and creates a
+            Symbol declaration for each variable
+
+            Notes
+            =====
+
+            The functions currently only support declaration of integer and
+            real variables. Other data types are still under development.
+
+            Raises
+            ======
+
+            NotImplementedError() when called for unsupported data types
+
+            """
+            if isinstance(node.type, asr.Integer):
+                var_type = IntBaseType(String('integer'))
+                value = Integer(0)
+            elif isinstance(node.type, asr.Real):
+                var_type = FloatBaseType(String('real'))
+                value = Float(0.0)
+            else:
+                raise NotImplementedError("Data type not supported")
+
+            if not (node.intent == 'in'):
+                new_node = Variable(
+                    node.name
+                ).as_Declaration(
+                    type = var_type,
+                    value = value
+                )
+                self._py_ast.append(new_node)
+
+        def visit_Sequence(self, seq):
+            """Visitor Function for code sequence
+
+            Visits a code sequence/ block and calls the visitor function on all the
+            children of the code block to create corresponding code in python
+
+            """
+            if seq is not None:
+                for node in seq:
+                    self._py_ast.append(call_visitor(node))
+
+        def visit_Num(self, node):
+            """Visitor Function for Numbers in ASR
+
+            This function is currently under development and will be updated
+            with improvements in the LFortran ASR
+
+            """
+            # TODO:Numbers when the LFortran ASR is updated
+            # self._py_ast.append(Integer(node.n))
+            pass
+
+        def visit_Function(self, node):
+            """Visitor Function for function Definitions
+
+            Visits each function definition present in the ASR and creates a
+            function definition node in the Python AST with all the elements of the
+            given function
+
+            The functions declare all the variables required as SymPy symbols in
+            the function before the function definition
+
+            This function also the call_visior_function to parse the contents of
+            the function body
+
+            """
+            # TODO: Return statement, variable declaration
+            fn_args = [Variable(arg_iter.name) for arg_iter in node.args]
+            fn_body = []
+            fn_name = node.name
+            for i in node.body:
+                fn_ast = call_visitor(i)
+            try:
+                fn_body_expr = fn_ast
+            except UnboundLocalError:
+                fn_body_expr = []
+            for sym in node.symtab.symbols:
+                decl = call_visitor(node.symtab.symbols[sym])
+                for symbols in decl:
+                    fn_body.append(symbols)
+            for elem in fn_body_expr:
+                fn_body.append(elem)
+            fn_body.append(
+                Return(
+                    Variable(
+                        node.return_var.name
+                    )
+                )
+            )
+            if isinstance(node.return_var.type, asr.Integer):
+                ret_type = IntBaseType(String('integer'))
+            elif isinstance(node.return_var.type, asr.Real):
+                ret_type = FloatBaseType(String('real'))
+            else:
+                raise NotImplementedError("Data type not supported")
+            new_node = FunctionDefinition(
+                        return_type = ret_type,
+                        name = fn_name,
+                        parameters = fn_args,
+                        body = fn_body
+                    )
+            self._py_ast.append(new_node)
+
+        def ret_ast(self):
+            """Returns the AST nodes"""
+            return self._py_ast
+else:
+    class ASR2PyVisitor():  # type: ignore
+        def __init__(self, *args, **kwargs):
+            raise ImportError('lfortran not available')
+
+def call_visitor(fort_node):
+    """Calls the AST Visitor on the Module
+
+    This function is used to call the AST visitor for a program or module
+    It imports all the required modules and calls the visit() function
+    on the given node
+
+    Parameters
+    ==========
+
+    fort_node : LFortran ASR object
+        Node for the operation for which the NodeVisitor is called
+
+    Returns
+    =======
+
+    res_ast : list
+        list of SymPy AST Nodes
+
+    """
+    v = ASR2PyVisitor()
+    v.visit(fort_node)
+    res_ast = v.ret_ast()
+    return res_ast
+
+
+def src_to_sympy(src):
+    """Wrapper function to convert the given Fortran source code to SymPy Expressions
+
+    Parameters
+    ==========
+
+    src : string
+        A string with the Fortran source code
+
+    Returns
+    =======
+
+    py_src : string
+        A string with the Python source code compatible with SymPy
+
+    """
+    a_ast = src_to_ast(src, translation_unit=False)
+    a = ast_to_asr(a_ast)
+    py_src = call_visitor(a)
+    return py_src