Em Andamento

Recursive Descent Parsing in C++ and Java

I need the following 'Recursive Descent Parsing' problem solved in BOTH C++ and Java. Full source code for both and console screen shots of it working are required.

Using the simplest possible technique to implement a recursive descent parser that recognizes strings in this language. Input should be from a file called in .dat and output should be to the console.

BNF grammar:


A -> I = E

E -> T + E | T - E | T

T -> P * T | P / T | P

P -> I | L | (E)

I -> a | b | ... | y | z

L -> 0 | 1 | ... | 8 | 9


An example session might look like this:


String read from file: a=a+b-c*d

The string "a=a+b-c*d" is in the language.

String read from file: a=a**b++c

The string "a=a**b++c" is not in the language.


IMPORTANT: You will not have to handle whitespace when parsing the string, i.e. " " and similiar are illegal characters in this language.

Habilidades: Programação C, Java

Ver mais: recursive descent parsing, recursive descent, java recursive descent parsing, parsing string, recursive descent java, recursive descent parsing example, console recursive, string source code java, string problem, string b, recursive problem, parsing input, read example, recursive descent source code, recursive descent parsing code, language recursive, recursive, problem java, kmz, java problem, java console, d java

Acerca do Empregador:
( 1 comentário ) Krakow, Poland

ID do Projeto: #531727

Premiar a:


I am interested...

$70 USD em 2 dias
(21 Avaliações)

2 freelancers estão ofertando em média $70 para este trabalho


Hello, Please check PMB

$70 USD in 2 dias
(27 Comentários)