Invite you to try FslexFsyacc #487

New Issue

claunia · 2026-01-29T14:37:57Z

claunia commented

2026-01-29 14:37:57 +00:00

Originally created by @xp44mm on GitHub (Dec 22, 2021).

compiler/parser programming enthusiasts, I am very pleased to invite you to try a new series of lex/yacc tools.

Fslex is a code generator that uses regular expression syntax as a rule to generate a function, which divides the input token sequence into groups at a higher level. The Fslex is often used to remove redundant delimiters, add omitted delimiters or other syntax components, and so on. The Fslex is also used to determine context somewhere in the stream.

Fsyacc is a code generator that use BNF productions and precedences as a rule to generate a function, which resolves the input token sequence to an abstract syntax tree.

Why use this package?

You can use your existing handwriting tokenizer.
This package uses standard lex/yacc syntax to minimize your learning costs.
fslex/fsyacc generates respectively an independent, side-effect-free function that can be called flexibly.
The method of generating code is simple, without command lines and without the need to configure projects.
The result code is data-driven and highly readable.
Flexiblely compose of tokenize, regular expressions, BNF technology.

You can check it by following the link: https://github.com/xp44mm/FslexFsyacc

Originally created by @xp44mm on GitHub (Dec 22, 2021). compiler/parser programming enthusiasts, I am very pleased to invite you to try a new series of lex/yacc tools. Fslex is a code generator that uses regular expression syntax as a rule to generate a function, which divides the input token sequence into groups at a higher level. The Fslex is often used to remove redundant delimiters, add omitted delimiters or other syntax components, and so on. The Fslex is also used to determine context somewhere in the stream. Fsyacc is a code generator that use BNF productions and precedences as a rule to generate a function, which resolves the input token sequence to an abstract syntax tree. Why use this package? - You can use your existing handwriting tokenizer. - This package uses standard lex/yacc syntax to minimize your learning costs. - fslex/fsyacc generates respectively an independent, side-effect-free function that can be called flexibly. - The method of generating code is simple, without command lines and without the need to configure projects. - The result code is data-driven and highly readable. - Flexiblely compose of tokenize, regular expressions, BNF technology. You can check it by following the link: https://github.com/xp44mm/FslexFsyacc

claunia added the question label 2026-01-29 14:37:57 +00:00

claunia closed this issue

2026-01-29 14:37:58 +00:00

claunia commented

2026-01-29 14:37:58 +00:00

@xoofx commented on GitHub (Dec 23, 2021):

Thanks for the proposal. Though, Markdown is not a good candidate for a lex/yacc parsing, as its grammar is ambiguous in multiple places and thus is not express-able in BNF form.

@xoofx commented on GitHub (Dec 23, 2021): Thanks for the proposal. Though, Markdown is not a good candidate for a lex/yacc parsing, as its grammar is ambiguous in multiple places and thus is not express-able in BNF form.

Sign in to join this conversation.

Branches Tags

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/markdig#487