Developer forums (C::B DEVELOPMENT STRICTLY!) > CodeCompletion redesign
New parser model for Code completion
rickg22:
Well , that's good to know, because you see... that's *NOT* how I plan to implement my state machine. See, your states are HARDWIRED. Just like Codeblocks' tokenizer. What I want to do is a state transition table, and a state transition interpreter.
takeshimiya:
Rick, perhaps you want to look at Libero:
State machine generators are closely related to the deterministic finite automata (DFA) generated by scanner generators like the one built into ANTLR. However, scanner generators are aimed at language applications and are not well suited for state machine generation outside this area. The Libero state machine generator from iMatix supports state machine generation for a variety of applications. It is released as GPL.
The input to Libero is a state machine diagram expressed in a textural language. The output can be in a variety of languages ranging from Java and C++ to COBOL.
However I think the ANTLR approach of parser generators with LL(k) is a lot better.
anonuser:
its the same idea, hard wired or not. just an example.
rickg22:
Yes, I see. But if we use a C++ generator, it means we'll have to recompile after adding all the language modules. And we'd need a state machine for EACH of the languages, instead of a global one and reading the states as data, depending on the model.
takeshimiya:
I think it's easier to recompile C::B to add support for a language, rather than writting entirely news grammar for that language, but that's just me :D
Navigation
[0] Message Index
[#] Next page
[*] Previous page
Go to full version