Given the following attribute grammar for type declarations, I need to be able to produce a parse tree for any given string, for example \"A, B : C;\", and then decorate the tree.
I understand how the difference between the two, how ambiguity means that t开发者_如何学Gohere is at least one string with 2 distinct parse trees while there is only one in an unambiguous tree. But I
I am tryin开发者_Python百科g to determine what is necessary to write a line profiler for a language, like those available for Python and Matlab.
Libraries such as intel-MKL or amd-ACML provide easier interface to SIMD operations on vectors, but I want to chain several functions together. Are there readily available libraries where I can regist
I\'m creating a text editor and I\'ve just finished writing the highlighting algorithms to have each of the syntax appear in a different color, and render in the right position using the proper parse
I\'m having trouble figuring out the antlr3 API so I can generate and use a parse tree in some javascript code. When I open the grammar file using antlrWorks (their IDE), the interpreter is able to sh
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
I\'ve been using Qi and Karma to do some processing on several small languages. Most of the grammars are pretty small (20-40 rules). I\'ve been able to use autorules almost exclusively, so my parse tr
I am trying to generate a syntax tree, for a given string with simple math operators (+, -, *, /, and parenthesis).
Is it possible to generate a parse tree at开发者_C百科 the same time as I use recursive descent parser to check if the data matches grammar?
加载中,请稍侯......