In article you write:
>
>> On 23 Apr 2015, at 16:34, brahim sahbi wrote:
>
>> can we use bison without flex by describing grammatical
>> rules for tokens(like number <- list_of_digits).
>
>A lexer like generated by Flex scans forward to find the longest match which
>may require significant looka
> On 23 Apr 2015, at 16:34, brahim sahbi wrote:
> can we use bison without flex by describing grammatical
> rules for tokens(like number <- list_of_digits).
A lexer like generated by Flex scans forward to find the longest match which
may require significant lookahead. A Bison generated parser
> On 23 Apr 2015, at 16:34, brahim sahbi wrote:
> can we use bison without flex by describing grammatical
> rules for tokens(like number <- list_of_digits).
A lexer like generated by Flex scans forward to find the longest match which
may require significant lookahead. A Bison generated parser
Hello,
I am new to bison. While I was reading the documentation, I asked myself
this question: can we use bison without flex by describing grammatical
rules for tokens(like number <- list_of_digits).
Can it recognize a language's keywords and prohibit an identifier to be a
keyword?
Thanks
Brahi
