Conversation

Notices

1. Embed this notice
   φ (fiore@brain.worm.pink)'s status on Friday, 31-Jan-2025 00:56:19 JST φ

   can someone teach me chomsky notation for grammars ina way that is actually intuitive ? like . why are those arrows ? it doesnt rlly make sense to me

   • Embed this notice
     chjara (chjara@akko.wtf)'s status on Friday, 31-Jan-2025 00:56:17 JST chjara

     in reply to
     @fiore it means that each lhs can generate a rhs. so like "E -> a ; E -> E + E" would mean that it's a possibility that E -> E + E -> a + E -> a + E + E -> a + a + E -> a + a + a
     run that in reverse and that's grammar recognition instead which is the main thing but the notation is about generation
     snacks likes this.
   • Embed this notice
     omen of instance annihilation (coolbean@brain.worm.pink)'s status on Friday, 31-Jan-2025 00:57:44 JST omen of instance annihilation

     in reply to

     • reia~!
     @reia @fiore i cant read the word forth in normal contexts anymore
     snacks likes this.
   • Embed this notice
     reia~! (reia@linfan.moe)'s status on Friday, 31-Jan-2025 00:57:45 JST reia~!

     in reply to
     @fiore going a bit back and forth between the two ways of writing it down might actually help you a lot in grasping how it works. it really likes automata, but when it comes to context-sensitive grammars, or even context-free ones, just writing the productions is often way easier for it, and the automata it writes are often just a funny-looking conversion of these productions
   • Embed this notice
     φ (fiore@brain.worm.pink)'s status on Friday, 31-Jan-2025 00:57:46 JST φ

     in reply to

     • reia~!

     @reia yea ,, an arrow becomes just . an “element” i suppose ? makes sense . thx !!

   • Embed this notice
     reia~! (reia@linfan.moe)'s status on Friday, 31-Jan-2025 00:57:47 JST reia~!

     in reply to
     @fiore with regular languages going between state machine diagrams and grammars is actually very simple, for an arrow from state A to state B via character s you just do A -> sB
   • Embed this notice
     φ (fiore@brain.worm.pink)'s status on Friday, 31-Jan-2025 00:57:48 JST φ

     in reply to

     • chjara

     @chjara oh ok ill stick with diagrams then i suppose ,, they feel much much more intuitive to me

   • Embed this notice
     φ (fiore@brain.worm.pink)'s status on Friday, 31-Jan-2025 00:57:49 JST φ

     in reply to

     • chjara

     @chjara i cannot understand where the “states” and the “arrows” that would make up a state machine diagram are in this tho :/

   • Embed this notice
     chjara (chjara@akko.wtf)'s status on Friday, 31-Jan-2025 00:57:49 JST chjara

     in reply to
     @fiore grammar classes have equivalent state/transition automata but i don't think there's a general straightforward mapping between the two