55
Comments
  • 1
    oh my.πŸ˜‚
  • 6
    can I ask what's that?
  • 8
    HOLY MOTHER OF GOD!

    I have no idea of what I'm looking at
  • 1
    HEEEEEELL NO!
  • 1
    Try the boost's statechart lib - you'll puke your soul
  • 2
    FYI, the more the number of states, the more the complexity. Number of states can often differentiate good and bad design
  • 1
    @frozentruth states can be nested for better simpler designs, i.e. X big general states, and each having Y smaller ones
  • 0
    Is dat neural network?
  • 0
    So um it starts with tv or v, ends with an s, but WHAT'S THE MEANING?
  • 0
    Wiki tells that it's string processor
    DAFUCK? PROCESS STRING WITH DAT SHIT? IT'S A SHOT IN A LEG!
  • 1
    Guys calm down it's just what a regex is evaluated to, no need to panic
    *kernel panic*
  • 0
    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.
  • 0
    @--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.
  • 0
    I would just give up if I were you
  • 0
    @milkbytes I really wanted to but this is for our lab exercise.
  • 1
    @--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
  • 1
    @matanl True, you need regular expressions to validate the tokens ands a grammar to validate the semantics of the language
  • 1
    @milkbytes oh right.. I remember writing bison declarations in our university's compilers course
  • 1
    @matanl I have an exam about this tomorrow πŸ˜…
  • 1
  • 0
Add Comment