grammar

Convert the grammar below into Chomsky Normal Form. Give all the intermediate steps. S -> AB | aB A -> aab|lambda B -> bbA Ok so the first thing I did was add a new start variable S0 so now I have S0 -> S S -> AB | aB A -> aab|lambda B -> bbA then I removed all of the lambda rules: S0 -> S S -> AB | aB | B A -> aab B -> bbA | bb Then I checked for S->S and A->B type rules which did not exist. And that was the answer I came up with, do I need to do anything further or did I do anything wrong? Wikipedia says: In computer science, a context-free grammar is said to be in Chomsky normal form if all

Last week I decided to give a try to Perl6 and started to reimplement one of my program. I have to say, Perl6 is so the easy for object programming, an aspect very painfull to me in Perl5. My program have to read and store big files, such as whole genomes (up to 3 Gb and more, See example 1 below) or tabulate data. The first version of the code was made in the Perl5 way by iterating line by line ("genome.fa".IO.lines). It was very slow and unsable for a correct execution time. my class fasta { has Str $.file is required; has %!seq; submethod TWEAK() { my $id; my $s; for $!file.IO.lines ->

Is there a publicly available grammar or parser for ARM's Unified Assembler Language as described in ARM Architecture Reference Manual A4.2 This document uses the ARM Unified Assembler Language (UAL). This assembly language syntax provides a canonical form for all ARM and Thumb instructions. UAL describes the syntax for the mnemonic and the operands of each instruction. Simply I'm interested in the code for parsing mnemonic and the operands of each instruction. For example how you could define a grammar for these lines? ADC{S}{<c>}{<q>} {<Rd>,} <Rn>, <Rm>, <type> <Rs> IT{<x>{<y>{<z>}}}{<q>}

This is an NLP problem and I was wondering how I should proceed. How difficult is the problem? Could I replace the word with synonyms and check that the grammar is correct? Replacing words with synonyms is probably the first thing to try, but be careful not to miss multiple words expressions and idioms. Also, make sure you choose a synonym with the same part of speech. they look for a good solution < ! > they view/stare/... for a good solution they work hard < ! > they job/task/… hard More complicated rephrasing is only possible if you use some level of grammatical analysis. You should at

I'm using ANTLR4 to create a parse tree for my grammar, what I want to do is modify certain nodes in the tree. This will include removing certain nodes and inserting new ones. The purpose behind this is optimization for the language I am writing. I have yet to find a solution to this problem. What would be the best way to go about this? While there is currently no real support or tools for tree rewriting, it is very possible to do. It's not even that painful. The ParseTreeListener or your MyBaseListener can be used with a ParseTreeWalker to walk your parse tree. From here, you can remove nodes

I just took my midterm but couldn't answer this question. Can someone please give a couple of examples of the language and construct a grammar for the language or at least show me how i will go about it? Also how to write grammar for L : L = {a n b m | n,m = 0,1,2,..., n <= 2m } ? Thanks in advance. Grijesh Chauhan How to write grammar for formal language? Before read my this answer you should read first: Tips for creating Context free grammars . Grammar for {a n b m | n,m = 0,1,2,..., n <= 2m } What is you language L = {a n b m | n,m = 0,1,2,..., n <= 2m } description? Language description :