A lexical analyser with 130 different grammars and tokens this is what my language looks like
imp una
imp dos
imp tres
pub class{myid:
pub {metodopub [intg par>:
Array myarray = new Array[4]
{for intg i = 0; i<4; i++:
dble high = 3
dble area = 5
dble result = 0
Font.Size
Font.Type
}
{whil x>8:
Btn.Name
{whil x>8:
Btn.Name
]
}
{swit op:
cas 1:
Math.Seno
{it ajk>4:
intg entero
flt flotante = 4
els:
flt flotante = 5
{it kuisjd<3:
Font.Size
}
}
brk
cas 2:
Math.Cose
brk
cas 3:
Math.Tang
brk
}
{it ak>4:
bool bandera
Math.Cose
Math.Seno
Math.Absol
}
}
priv {metodopriv <intg paremtro>:
obj mid = new obj
queue col = new queue
stack pil = new stack
list lis = new list
dict di = new dict
Math.Raiz
}
prote {metodoprote <intg paremtro>:
obj mid = new obj
queue col = new queue
stack pil = new stack
list lis = new list
dict di = new dict
Math.Elev
}
}