Necesito ayuda para integrar un generador de c$$digo $($genera un c$$digo objeto $.$o del c$$digo C le$$do desde un txt$)$ en este analizador l$$xico$,$ sint$$ctico y sem$$ntico: import re import tkinter as tk from tkinter import filedialog, Text import pandas as pd import numpy as np # Analizador l$$xico LEXER$\_$TABLE $=$ pd$.$DataFrame$($columnas$=[\text{'}$TOKEN$\text{'},$ 'IDENTITY'$],$ index$=$range$(1))$ def lexer$($c$$digo$)$: S$$MBOLOS $=[\text{'}(\text{'},\text{'})\text{'},\text{'}$;$\text{'},\text{'},\text{'},\text{'}$:$\text{'},\text{'}\backslash \text{'}\text{'}]$ SYMBOLS$\_1=[\text{'}(\text{'},\text{'})\text{'},\text{'}$;$\text{'},\text{'},\text{'},\text{'}$:$\text{'},\text{'}\backslash \text{'}\text{'},\text{'}+\text{'},\text{'}=\text{'},\text{'}>\text{'}]$ SYMBOLS$\_1\_$DUP $=[[\text{'}$Abrir corchetes', $\text{'}(\text{'}],[\text{'}$Cerrar corchetes', $\text{'})\text{'}],[\text{'}$Punto y coma', $\text{'}$;$\text{'}],[\text{'}$Coma$\text{'},\text{'},\text{'}],[\text{'}$Dolo$\text{'},\text{'}$:$\text{'}],[\text{'}$Comilla simple', $\text{'}\backslash \text{'}\text{'}],[\text{'}$m$$s$\text{'},\text{'}+\text{'}],[\text{'}$igual$\text{'},\text{'}=\text{'}],[\text{'}$mayor$\text{'},\text{'}>\text{'}]]$ palabras clave $=[\text{'}$entero$\text{'},$ 'principal', 'mientras', 'comienzo', 'fin', 'expr', $\text{'}\text{'},\text{'}\text{'},$ 'Procedimiento', $\text{'}$Si$\text{'},$ 'elseif', 'else' $,$ 'entonces', 'printf', $\text{'}$y$\text{'},\text{'}$o$\text{'}]$ palabras clave$\_$def $=[[\text{'}$t$\text{'},$ 'integer'$],[\text{'}$m$\text{'},$ 'principal'$],[\text{'}$l$\text{'},$ 'mientras'$],[\text{'}$b$\text{'},$ 'comienzo'$],[\text{'}$d$\text{'},$ 'fin'$],[\text{'}$e$\text{'},$ 'expr'$],[\text{'}$s$\text{'},\text{'}\text{'}],[\text{'}$o$\text{'},\text{'}+\text{'}],[\text{'}$o$\text{'},\text{'}=\text{'}],[\text{'}$n$\text{'},\text{'}\text{'}],[\text{'}$p$\text{'},$ 'Procedimiento'$],[\text{'}$x$\text{'},\text{'}$If$\text{'}],[\text{'}$z$\text{'},$ 'elseif'$],[\text{'}$ y$\text{'},\text{'}$m$$s$\text{'}],[\text{'}$f$\text{'},$ 'entonces'$],[\text{'}$c$\text{'},$ 'printf'$],[\text{'}$&$\text{'},\text{'}$y$\text{'}],[\text{'}|\text{'},\text{'}$o$\text{'}],[\text{'}$ o$\text{'},\text{'}>\text{'}]]$ PALABRAS CLAVE $=$ S$$MBOLOS$\_1+$ palabras clave espacio$\_$blanco $=\text{'}\text{'}$ lexema $=\text{'}\text{'}$ tokens $=[]$ c$$digo $=$ code.replace$(\text{'}\backslash$t$\text{'},\text{'}\text{'})$ para i$,$ char en enumerar$($c$$digo$)$: if char $!=$ espacio$\_$blanco: lexema $+=$ char if $($i $+1<$ len$($c$$digo$))$: if c$$digo$[$i $+1]==$ espacio$\_$blanco o c$$digo$[$i $+1]$ en PALABRAS CLAVE o lexema en PALABRAS CLAVE: if lexema $!=\text{'}\text{'}$: tokens.append$($lexeme$.$replace$(\text{'}\text{'},\text{'}\text{'}))$ lexema $=\text{'}\text{'}$ j $=0$ para i en tokens: para k en SYMBOLS$\_1\_$DUP: si i $==$ k$[1]$: LEXER$\_$TABLE.at$[$j$,\text{'}$ TOKEN'$]=$ i LEXER$\_$TABLE.at$[$j$,$ 'IDENTITY'$]=$ k$[0]$ j $+=1$ descanso si i en palabras clave: LEXER$\_$TABLE.at$[$j$,$ 'TOKEN'$]=$ i LEXER$\_$TABLE.at$[$j$,$ 'IDENTITY $\text{'}]=$ 'Palabra clave' j $+=1$ continuar si i$.$isdigit$()$: LEXER$\_$TABLE.at$[$j$,$ 'TOKEN'$]=$ i LEXER$\_$TABLE.at$[$j$,$ 'IDENTITY'$]=\text{'}$D$$gito$\text{'}$ j $+=1$ continuar elif No estoy en PALABRAS CLAVE: LEXER$\_$TABLE.at$[$j$,$ 'TOKEN'$]=$ i LEXER$\_$TABLE.at$[$j$,$ 'IDENTITY'$]=$ 'Identificador' j $+=1$ print$($f$"$Lexer Tokens: $\{$tokens$\}")$ # Salida de depuraci$$n tokens de retorno # Analizadores de sintaxis y sem$$ntica $($ejemplo simplificado$)$ EPSILON $="\backslash$epsi $"$ gram$$tica $=["$S$->$E$","$E$->$E$+$T$","$E$->$T$","$T$->$T$*$F $","$T$->$F$","$F$->($E$)","$F$->$id$"]$ def get$\_$productions$($X$)$: producciones $=[]$ para prod en gram$$tica: lhs$,$ rhs $=$ prod.split$(\text{'}->\text{'})$ if lhs $==$ X: rhs $=\text{'}.\text{'}+$rhs Productions.append$(\text{'}->\text{'}.$join$([$lhs$,$ rhs$]))$ return producciones def cierre$($I$)$: para producci$$n$,$ a en I: if producci$$n$.$endswith$(".")$: continuar lhs$,$ rhs $=$ producci$$n$.$split$(\text{'}->\text{'})$ alfa, B$\_$beta $=$ rhs$.$split$(\text{'}.\text{'})$ B $=$ B$\_$beta$[0]$ beta $=$ B$\_$beta$[1$:$]$ beta$\_$a $=$ a si beta: beta$\_$a $=$ beta$[0]+$a first$\_$beta$\_$a $=$ first$($beta$\_$a$)$ for b in first$\_$beta$\_$a: B$\_$productions $=$ get$\_$productions$($B$)$ for gamma in B$\_$productions: new$\_$item $=($gamma$,$ b$)$ if $($new$\_$item not in I$)$: I $.$append$($new$\_$item$)$ return Definitivamente get$\_$symbols$($grammar$)$: terminales $=$ set$()$ non$\_$terminals $=$ set$()$ para producci$$n en gram$$tica: lhs$,$ rhs $=$ production.split$(\text{'}->\text{'})$ non$\_$terminals.add$($lhs$)$ for x in rhs: terminales.add$($x$)$ terminales $=$ terminales.difference$($non$\_$terminals$)$ terminales.add$(\text{'}$$$\text{'})$ devuelve terminales, non$\_$terminals def first$($symbols$)$: final$\_$set $=$ set$()$ para X en s$$mbolos: first$\_$set $=$ set$()$ if isTerminal$($X$)$: final$\_$set.add$($X$)$ else: para producci$$n en gram$$tica: lhs$,$ rhs $=$ production.split$(\text{'}->\text{'})$ if lhs $==$ X: para i en rango$($len$($rhs$))$: y $=$ rhs$[$i$]$ si y $==$ X: continuar first$\_$y $=$ first$($y$)$ si EPSILON en first$\_$y: first$\_$y $=$ first$\_$y$.$replace$($EPSILON$,"")$ first$\_$set.add$($first$\_$y$)$ continuar de lo contrario: first$\_$set.add$($first$\_$y$)$ romper para i en first$\_$set: si EPSILON no est$$ en i: final$\_$set.add$($i$)$ m$$s: i $=$ i$.$replace$($EPSILON$,"")$ final$\_$set.add$($i$)$ return $"".$join$($list$($final$\_$set$))$ def isTerminal$($symbol $)$: s$$mbolo de retorno en terminales def shift$\_$dot$($producci$$n$)$: lhs$,$ rhs $=$ production.split$(\text{'}->\text{'})$ x$,$ y $=$ rhs$.$split$(".")$