[GNU ELPA] Lex version 1.2
Version 1.2 of package Lex has just been released in GNU ELPA. You can now find it in M-x list-packages RET. Lex describes itself as: = Lexical analyser construction = More at https://elpa.gnu.org/packages/lex.html ## Summary: Format of regexps is the same as used for `rx' and `sregex'. Additions: - (ere RE) specify regexps using the ERE syntax. - (inter REs...) (aka `&') make a regexp that only matches if all its branches match. E.g. (inter (ere ".*a.*") (ere ".*b.*")) match any string that contain both an "a" and a "b", in any order. - (case-fold REs...) and (case-sensitive REs...) make a regexp that is case sensitive or not, regardless of case-fold-search. Input format of lexers: ALIST of the form ((RE . VAL) ...) Format of compiled DFA lexers: nil ; The trivial lexer that fails (CHAR . LEXER) (table . CHAR-TABLE) (stop VAL . LEXER) ; Match the empty string at point or LEXER. (check (PREDICATE . ARG) SUCCESS-LEXER . FAILURE-LEXER) ## Recent NEWS:
[GNU ELPA] Lex version 1.2
Version 1.2 of package Lex has just been released in GNU ELPA. You can now find it in M-x list-packages RET. Lex describes itself as: = Lexical analyser construction = More at https://elpa.gnu.org/packages/lex.html ## Summary: Format of regexps is the same as used for `rx' and `sregex'. Additions: - (ere RE) specify regexps using the ERE syntax. - (inter REs...) (aka `&') make a regexp that only matches if all its branches match. E.g. (inter (ere ".*a.*") (ere ".*b.*")) match any string that contain both an "a" and a "b", in any order. - (case-fold REs...) and (case-sensitive REs...) make a regexp that is case sensitive or not, regardless of case-fold-search. Input format of lexers: ALIST of the form ((RE . VAL) ...) Format of compiled DFA lexers: nil ; The trivial lexer that fails (CHAR . LEXER) (table . CHAR-TABLE) (stop VAL . LEXER) ; Match the empty string at point or LEXER. (check (PREDICATE . ARG) SUCCESS-LEXER . FAILURE-LEXER) ## Recent NEWS:
