54 lines
1.5 KiB
Python
54 lines
1.5 KiB
Python
|
#question 1:
|
||
|
|
# i = 3 Literal Type: Integer, and its value is 3.
|
||
|
|
|
||
|
|
# f = 3.0 Literal Type: Float, and its value is 3.0.
|
||
|
|
|
||
|
|
# c = 3+3j Literal Type: Complex, and its value is 3+3j.
|
||
|
|
|
||
|
|
# b = b'abcdefg' Literal Type: Bytes, and its value is b'abcdefg'.
|
||
|
|
|
||
|
|
# s = 'abcdefg' Literal Type: String, and its value is 'abcdefg'.
|
||
|
|
|
||
|
|
# s = "abcdefg" Literal Type: String, and its value is "abcdefg".
|
||
|
|
|
||
|
|
#question 2:
|
||
|
|
'''
|
||
|
|
'0' b'0' 0 0.0 0j
|
||
|
|
'0' Equal |Not equal |Not equal |Not equal |Not equal
|
||
|
|
b'0'Not equal |Equal |Not equal |Not equal |Not equal
|
||
|
|
0 Not equal |Not equal |Equal |Equal |Equal
|
||
|
|
0.0 Not equal |Not equal |Equal |Equal |Not Equal
|
||
|
|
0j Not equal |Not equal |Equal |Not equal |Equal
|
||
|
|
'''
|
||
|
|
#question 3:
|
||
|
|
##The "+" operator case:
|
||
|
|
'''
|
||
|
|
'0' b'0' 0 0.0 0j
|
||
|
|
'0' '00' |TypeError |TypeError |TypeError |TypeError
|
||
|
|
b'0' TypeError |b'00' |TypeError |TypeError |TypeError
|
||
|
|
0 TypeError |TypeError |0 |0.0 |0j
|
||
|
|
0.0 TypeError |TypeError |0.0 |0.0 |TypeError
|
||
|
|
0j TypeError |TypeError |0j |TypeError |0j
|
||
|
|
'''
|
||
|
|
##The "==" operator case:
|
||
|
|
'''
|
||
|
|
'0' b'0' 0 0.0 0j
|
||
|
|
'0' True |False |False |False |False
|
||
|
|
b'0 False |False |False |False |False
|
||
|
|
0 False |False |False |True |True
|
||
|
|
0.0 False |False |True |True |False
|
||
|
|
0j False |False |True |False |True
|
||
|
|
'''
|
||
|
|
#question4:
|
||
|
|
import ast
|
||
|
|
|
||
|
|
# Open the lexer/parser example file
|
||
|
|
with open('lexer_parser_example.py', 'r') as file:
|
||
|
|
source_code = file.read()
|
||
|
|
|
||
|
|
# Parse the source code into an AST
|
||
|
|
tree = ast.parse(source_code)
|
||
|
|
|
||
|
|
# Dump the AST
|
||
|
|
print(ast.dump(tree, indent=4))
|