• Breaking News

    Wednesday, March 28, 2018

    How do I use Java Cup to prove if context-free grammars are LALR(1)? Computer Science

    How do I use Java Cup to prove if context-free grammars are LALR(1)? Computer Science


    How do I use Java Cup to prove if context-free grammars are LALR(1)?

    Posted: 27 Mar 2018 07:08 PM PDT

    The task is in the image. There are context-free grammars about RNA secondary structure. https://i.stack.imgur.com/3hPQw.png

    S -> a S | c S | g S | u S # unpaired bases - left.

    S -> a | c | g | u # unpaired bases

    S -> a S u | u S a | c S g | g S c # watson crick pairings

    S -> S S # bifurcation

    My professor asked me to use an application, Java Cup, to prove if they are LALR(1). http://www2.cs.tum.edu/projects/cup/index.php

    I have installed Java Cup in eclipse and run a sample, like this youtube. https://youtu.be/dJp_4GjcP5w

    But I totally have no idea how to do next step......

    Could anyone give me advice? Thank you very much.

    submitted by /u/LockeLin
    [link] [comments]

    No comments:

    Post a Comment