[DiscordArchive] Wasn't there a guy who made a website where you just have to upload your DBC files and it will give
[DiscordArchive] Wasn't there a guy who made a website where you just have to upload your DBC files and it will give
Archived author: Kaev • Posted: 2025-08-13T11:00:51.037000+00:00
Original source
Wasn't there a guy who made a website where you just have to upload your DBC files and it will give you a talent editor?
Archived author: Kaev • Posted: 2025-08-13T11:01:00.437000+00:00
Original source
only 3.3.5 though afaik
Archived author: stoneharry • Posted: 2025-08-13T11:07:18.832000+00:00
Original source
Spell editor does parsing mostly using regular expressions that could be copied, but it's fairly ugly. It should be a recursive descent parser.
Archived author: Andser • Posted: 2025-08-13T11:24:59.339000+00:00
Original source
Is it known how the wow client does it? I'd assume regexp as well, but you never know.
Archived author: Andser • Posted: 2025-08-13T11:26:26.796000+00:00
Original source
For vanilla there isn't much complexity anyway when it comes to just talents. The most you get is a reference to another spell's column, e.g. "Deal $1234s1% increased damage."
Archived author: Andser • Posted: 2025-08-13T11:28:09.047000+00:00
Original source
That would boil down to check if there's a spell ID after $, if not use the current spell and the s1, u, d... stuff is trivial column matching
Archived author: Andser • Posted: 2025-08-13T11:29:31.127000+00:00
Original source
and of course also resolve duration/area indexes
Archived author: stoneharry • Posted: 2025-08-13T11:36:27.307000+00:00
Original source
I've not tried to reverse it, but recursive descent parser is pretty standard: https://en.m.wikipedia.org/wiki/Recursiv...ent_parser
If you want quick and dirty, just use regular expressions to extract and parse. Otherwise use a parser.
[Embed: Recursive descent parser]
In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where each such procedure implements one of the nonterminals of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes.
A predictive par...
https://en.m.wikipedia.org/wiki/Recursiv...ent_parser
Archived author: Widget • Posted: 2025-08-13T11:40:20.698000+00:00
Original source
oh it is not difficult, its just messy and blizzard is inconsistent af in there
![[Image: image.png?ex=690c6069&is=690b0ee9&hm=bce...6056e4858&]](https://cdn.discordapp.com/attachments/408013572430626817/1405291459984490558/image.png?ex=690c6069&is=690b0ee9&hm=bceae7065fb975d0e3f82363c60d12c4ee439705b1ac014efe4d51f6056e4858&)
Archived author: Andser • Posted: 2025-08-13T20:46:33.154000+00:00
Original source
Cheers for the idea, I've written it in a fairly ugly way because typescript and the result is this.
A 2nd pass would go through the replacements and apply the relevant column data.
![[Image: image.png?ex=690c6069&is=690b0ee9&hm=bce...6056e4858&]](https://cdn.discordapp.com/attachments/408013572430626817/1405291459984490558/image.png?ex=690c6069&is=690b0ee9&hm=bceae7065fb975d0e3f82363c60d12c4ee439705b1ac014efe4d51f6056e4858&)