KILL ME. 😵

oh my.😂

can I ask what's that?

HEEEEEELL NO!

Try the boost's statechart lib - you'll puke your soul

FYI, the more the number of states, the more the complexity. Number of states can often differentiate good and bad design

@frozentruth states can be nested for better simpler designs, i.e. X big general states, and each having Y smaller ones

Is dat neural network?

So um it starts with tv or v, ends with an s, but WHAT'S THE MEANING?

Wiki tells that it's string processor
DAFUCK? PROCESS STRING WITH DAT SHIT? IT'S A SHOT IN A LEG!

Guys calm down it's just what a regex is evaluated to, no need to panic
*kernel panic*

BTW, I'm creating a C function definition DFA. And so far, I've only accomplished variable declaration, operations, pointers and return statements. And yes, it was a fucking mess to make, and I'm still going to create the automata for the rest of the C syntax.

@--hi-- For those who are wondering, I used codes for the inputs, (e.g. T for type, V for variable, C for comma, S for semis, etc etc). Cause I'm too lazy to type the full word.

I would just give up if I were you

@milkbytes I really wanted to but this is for our lab exercise.

@--hi-- it's a joke right? C's syntax is not regular, you can't even check whether you have a closing paranthesis using a finite automata

@matanl True, you need regular expressions to validate the tokens ands a grammar to validate the semantics of the language

@milkbytes oh right.. I remember writing bison declarations in our university's compilers course

@matanl I have an exam about this tomorrow 😅

@milkbytes good luck!

@matanl Thanks!