lexing, syntax analysis? I'm creating a very basic library that creates combinations provided in single string. Example: A{B,C{D,E}F,G}H{J,K}L{3..5} -> ABHJL3, ABHJL4, ABHJL5, ACDFHJL3, ACDFHJL4, ACDFHJL5, ACEFHJL3, ACEFHJL4, ACEFHJL5, and so on... I'm pulling my hairs... Tokenizing part is done. But parsing... Gosh, I wish that I was never born. Anyone knows any group that could help me, show me ways?
Define the grammar for your combination syntax. Choose a parsing algorithm (e.g., recursive descent). Implement the parser, starting with simple constructs and building up. Generate the combinations after successful parsing. Remember to iterate, review, and seek online resources for assistance - chatGPT
I'm cooperating with chatgpt already...
Обсуждают сегодня