Context Free Grammar Checker

$30-100 USD

Em Andamento

Publicado

há mais de 11 anos

$30-100 USD

Pago na entrega

The objective of this project is to determine if a given string can be generated by a context free grammar (CFG) by showing its derivation tree. The inputs are: 1. Set of terminals 2. Set of non-terminals. 3. Set of all the production rules, one per line. Use # in place of empty string Place *** after the last rule. 4. The input string. For example, an input of: a b S A S —> aSbA S -> # A -> bbAa A -> aa *** aabaabbbaaa The system will indicate whether the string belongs or not to the given CFG, and in case it does belong then proceed to show its full derivation tree the program must be simple , clear ,commented and documented thank you.

Java

ID do Projeto: 4079385

Sobre o projeto

5 propostas

Projeto remoto

Ativo há 11 anos

Quer ganhar algum dinheiro?

Endereço de e-mail

Benefícios de ofertar no Freelancer

Defina seu orçamento e seu prazo

Seja pago pelo seu trabalho

Descreva sua proposta

É grátis para se inscrever e fazer ofertas em trabalhos

Concedido a:

@bernacek

Please check my demo at: [login to view URL] and let me know is it what you need. It is a demo so grammar is fixed (can't be changed on demo) but you can play with the text entered. The result is displayed in a standard JTree using a directory-like structure.

$79 USD em 2 dias

5,0

(8 avaliações)

4,6

5 freelancers estão ofertando em média $84 USD for esse trabalho

@dobreiiita

Hello, I am expert and dedicated in JAVA Development.I am very much interested for your project. I can complete your project quickly and efficiently in time. Details will be discussed in the message.

$100 USD em 5 dias