Reply to this email directly, view it on GitHub, or unsubscribe.
You are receiving this because you are subscribed to this thread.
@cousteaulecommandant Sorry for the late response :-(
If it's not a big problem (and it shouldn't be, you should be able to simulate what the regex parser does), I'd suggest that you update your parser with all features that the universal-ctags regex parser has (otherwise it won't be accepted) and then submit it to the universal-ctags project. The maintainer is very responsive and I don't expect he wouldn't accept it. Or maybe even better, open an issue there and ask there and ask first to avoid some unnecessary work.
A readline-based parser will always be a compromise - it's easy to create something functional quickly but the more and more language features you add, the more messy it will be. So if you want to create some more complex parser, you'd have to create a token-based parser.
From my point of view, the Matlab parser in Geany fulfilled its purpose - it attracted a Matlab developer, you, who also knows C and who is able to improve it. Done :-). So I think in the next time we update ctags parsers, I'll grab whatever parser there is in the ctags project - if you manage to get your parser to ctags afterwards, just ping me, and I'll grab it for Geany.
—
Reply to this email directly, view it on GitHub, or unsubscribe.
You are receiving this because you are subscribed to this thread.