Edit File: flex.mo
�������������\������� ������(��7���)�� ���a�����o��������������/������'�����������.���/�����^�����s��"�����#������������ ������ ������*�����3���G�����{��������!������C������$�����)���9�����c��%���}��"������#�����������������������F���(�����o��������`������"�����&���%��0���L��+���}�������� ������������������$�����"���,��)���O�����y��4������5������E�����/���J��.���z��&������(������+���������%�����B��6���^��!������"�������������������������������4�����N�����l����������������������������������������-��#���G�� ���k�����������������������F$��(���[$������$������$��2����$��#����$��+���%�����-%��&���K%�����r%�� ����%������%������%������%��*����%��C���&��3���T&��0����&��%����&������&��%����&�����$'��+���>'�����j'��"���~'������'������'������'������'������'��,���(��3���B(��/���v(�� ����(������(��(����(������(��(��� )��+���6)�����b)������)������)������)������)������)�����*�����0*�����N*�����k*������*��'����*������*��$����*��2���+�� ���5+�����V+��,���q+��-����+��&����+�� ����+�� ���,�����,�����',��!���:,��&���\,������,��!����,�� ����,������,��0����,��!���-�����7-�����D-�����Y-�����s-��%����-��F����-������-�����.����� .�����7.�����Q.��"���h.������.������.������.��<����.��-���/��{��=/��7����0�� ����0������0�����1�����51��/���M1��'���}1������1��.����1������1�����2��"���2��#���22�����V2�� ���j2�� ����2��*����2��3����2�����3�����*3��!���>3��C���`3��$����3��)����3������3��%��� 4��"���34��#���V4�����z4������4������4��F����4������4�����5��`���15��"����5��&����5��0����5��+��� 6�����96�� ���@6�����a6�����6��$����6��"����6��)����6����� 7��4���)7��5���^7��E����7��/����7��.��� 8��&���98��(���`8��+����8������8������8��6����8��!���%9��"���G9�����j9������9������9������9������9������9������9�����:�����1:�����K:�����f:������:������:������:��#����:�� ����:�����;�����;;�����G;������F��(����F�����G�����(G��2���>G��#���qG��+����G������G��*����G����� H�����H�����0H�����NH�����mH��*����H��C����H��3����H��0���(I��%���YI�����I��%����I������I��/����I�����J��"���"J�����EJ�����_J�����qJ������J������J��,����J��3����J��/���K�� ���JK�����XK��(���tK������K��(����K��+����K�����L�����$L�����?L�����]L�����zL������L������L������L������L�����M�����,M��'���>M�����fM��$����M��2����M�� ����M������M��,���N��-���FN��&���tN�� ����N�� ����N������N������N��!����N��*���O�����3O��%���QO�� ���wO������O��0����O��!����O������O������O�����P�����+P��%���8P��F���^P������P������P������P������P����� Q��"���$Q�����GQ�����aQ������Q��<����Q��-����Q�����&���>���������������������������Z������������������P���`���=���d���e���S�������������������H������3�����������-��������������n���s�����������������������~���6�������!����������E������O���R���%���W���"���z������������������T�����������i���Y������������������������������������������\���C���X���v���M���[���������������+��������������m���p��� �������N���,�������:���?����������������������������������<�����������;���������#���k���������������8�������y�������������U������������������o���G�������������������������������������A���^������)���|�������h������x�������J���]���c�������@���5���������������'������I��� ���/���g�����������F���������������u���{���b��������������������$���������������q�����������K���9���r���7������(�������0������4���Q����������a���V���f�������}���t���j���2���w������B������L���D������� �����������1���*�������_�����������l�����������.������� ����������� ********** beginning dump of nfa with start state %d � DFA Dump: � Equivalence Classes: � Meta-Equivalence Classes: � jam-transitions: EOF � %d (%d saved) hash collisions, %d DFAs equal � %d backing-up (non-accepting) states � %d empty table entries � %d epsilon states, %d double epsilon states � %d protos created � %d rules � %d sets of reallocations needed � %d state/nextstate pairs created � %d table entries � %d templates created, %d uses � %d total table entries needed � %d/%d (peak %d) nxt-chk entries created � %d/%d (peak %d) template nxt-chk entries created � %d/%d DFA states (%d words) � %d/%d NFA states � %d/%d base-def entries created � %d/%d character classes needed %d/%d words of storage, %d reused � %d/%d equivalence classes created � %d/%d meta-equivalence classes created � %d/%d start conditions � %d/%d unique/duplicate transitions � Beginning-of-line patterns used � Compressed tables always back-up � No backing up � no character classes � scanner options: -� and may be the actual source of other reported performance penalties � associated rule line numbers:� out-transitions: �%%option yylineno entails a performance penalty ONLY on rules that can match newline characters �%array incompatible with -+ option�%d backing up (non-accepting) states. �%option yyclass only meaningful for C++ scanners�%option yylineno cannot be used with REJECT�%s %s �%s version %s usage statistics: �%s: fatal internal error, %s �********** end of dump �*Something Weird* - tok: %d val: %d �-Cf and -CF are mutually exclusive�-Cf/-CF and -Cm don't make sense together�-Cf/-CF and -I are incompatible�-Cf/-CF are incompatible with lex-compatibility mode�-I (interactive) entails a minor performance penalty �-l AT&T lex compatibility option entails a large performance penalty �-s option given but default rule can be matched�Allocation of buffer for line directive failed�Allocation of buffer for m4 def failed�Allocation of buffer for m4 undef failed�Allocation of buffer to print string failed�Can't use -+ with -CF option�Can't use -+ with -l option�Can't use --reentrant or --bison-bridge with -l option�Can't use -f or -F with -l option�Compressed tables always back up. �Could not write ecstbl�Could not write eoltbl�Could not write ftbl�Could not write ssltbl�Could not write yyacc_tbl�Could not write yyacclist_tbl�Could not write yybase_tbl�Could not write yychk_tbl�Could not write yydef_tbl�Could not write yymeta_tbl�Could not write yynultrans_tbl�Could not write yynxt_tbl�Could not write yynxt_tbl[][]�Definition name too long �Definition value for {%s} too long �EOF encountered inside an action�EOF encountered inside pattern�End Marker �Generates programs that perform pattern-matching on text. Table Compression: -Ca, --align trade off larger tables for better memory alignment -Ce, --ecs construct equivalence classes -Cf do not compress tables; use -f representation -CF do not compress tables; use -F representation -Cm, --meta-ecs construct meta-equivalence classes -Cr, --read use read() instead of stdio for scanner input -f, --full generate fast, large scanner. Same as -Cfr -F, --fast use alternate table representation. Same as -CFr -Cem default compression (same as --ecs --meta-ecs) Debugging: -d, --debug enable debug mode in scanner -b, --backup write backing-up information to %s -p, --perf-report write performance report to stderr -s, --nodefault suppress default rule to ECHO unmatched text -T, --trace %s should run in trace mode -w, --nowarn do not generate warnings -v, --verbose write summary of scanner statistics to stdout --hex use hexadecimal numbers instead of octal in debug outputs Files: -o, --outfile=FILE specify output filename -S, --skel=FILE specify skeleton file -t, --stdout write scanner on stdout instead of %s --yyclass=NAME name of C++ class --header-file=FILE create a C header file in addition to the scanner --tables-file[=FILE] write tables to FILE Scanner behavior: -7, --7bit generate 7-bit scanner -8, --8bit generate 8-bit scanner -B, --batch generate batch scanner (opposite of -I) -i, --case-insensitive ignore case in patterns -l, --lex-compat maximal compatibility with original lex -X, --posix-compat maximal compatibility with POSIX lex -I, --interactive generate interactive scanner (opposite of -B) --yylineno track line count in yylineno Generated code: -+, --c++ generate C++ scanner class -Dmacro[=defn] #define macro defn (default defn is '1') -L, --noline suppress #line directives in scanner -P, --prefix=STRING use STRING as prefix instead of "yy" -R, --reentrant generate a reentrant C scanner --bison-bridge scanner for bison pure parser. --bison-locations include yylloc support. --stdinit initialize yyin/yyout to stdin/stdout --noansi-definitions old-style function definitions --noansi-prototypes empty parameter list in prototypes --nounistd do not include <unistd.h> --noFUNCTION do not generate a particular FUNCTION Miscellaneous: -c do-nothing POSIX option -n do-nothing POSIX option -? -h, --help produce this help message -V, --version report %s version �Input line too long �Internal error. flexopts are malformed. �No backing up. �Option line too long �Options -+ and --reentrant are mutually exclusive.�REJECT cannot be used with -f or -F�REJECT entails a large performance penalty �State #%d is non-accepting - �Try `%s --help' for more information. �Unknown error=(%d) �Unmatched '{'�Unrecognized option `%s' �Usage: %s [OPTIONS] [FILE]... �Usage: %s [OPTIONS]... �Variable trailing context rule at line %d �Variable trailing context rules entail a large performance penalty �[:^lower:] is ambiguous in case insensitive scanner�[:^upper:] ambiguous in case insensitive scanner�allocation of macro definition failed�allocation of sko_stack failed�attempt to increase array size failed�bad <start condition>: %s�bad character '%s' detected in check_char()�bad character class�bad character class expression: %s�bad character inside {}'s�bad character: %s�bad iteration values�bad line in skeleton file�bad start condition list�bad state type in mark_beginning_as_normal()�bad transition character detected in sympartition()�bison bridge not supported for the C++ scanner.�can't open %s�can't open skeleton file %s�consistency check failed in epsclosure()�could not create %s�could not create backing-up info file %s�could not create unique end-of-buffer state�could not write tables header�dangerous trailing context�empty machine in dupmachine()�error closing backup file %s�error closing output file %s�error closing skeleton file %s�error creating header file %s�error deleting output file %s�error writing backup file %s�error writing output file %s�fatal parse error�found too many transitions in mkxtion()�incomplete name definition�input error reading skeleton file %s�input rules are too complicated (>= %d NFA states)�iteration value must be positive�malformed '%top' directive�memory allocation failed in allocate_array()�memory allocation failed in yy_flex_xmalloc()�memory allocation failure in xstrdup()�missing quote�missing }�name "%s" ridiculously long�name defined twice�negative range in character class�option `%s' doesn't allow an argument �option `%s' is ambiguous �option `%s' requires an argument �premature EOF�rule cannot be matched�scanner requires -8 flag to use the character %s�start condition %s declared twice�state # %4d �state # %d accepts: �state # %d accepts: [%d] �state # %d: �symbol table memory allocation failed�the character range [%c-%c] is ambiguous in a case-insensitive scanner�too many rules (> %d)!�trailing context used twice�unbalanced parenthesis�undefined definition {%s}�unknown -C option '%c'�unknown error processing section 1�unrecognized %%option: %s�unrecognized '%' directive�unrecognized rule�variable trailing context rules cannot be used with -f or -F�yymore() entails a minor performance penalty �Project-Id-Version: flex 2.6.1 Report-Msgid-Bugs-To: flex-devel@lists.sourceforge.net POT-Creation-Date: 2016-03-01 19:54-0500 PO-Revision-Date: 2016-03-01 19:54-0500 Last-Translator: Automatically generated Language-Team: none Language: en@quot MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Plural-Forms: nplurals=2; plural=(n != 1); � ********** beginning dump of nfa with start state %d � DFA Dump: � Equivalence Classes: � Meta-Equivalence Classes: � jam-transitions: EOF � %d (%d saved) hash collisions, %d DFAs equal � %d backing-up (non-accepting) states � %d empty table entries � %d epsilon states, %d double epsilon states � %d protos created � %d rules � %d sets of reallocations needed � %d state/nextstate pairs created � %d table entries � %d templates created, %d uses � %d total table entries needed � %d/%d (peak %d) nxt-chk entries created � %d/%d (peak %d) template nxt-chk entries created � %d/%d DFA states (%d words) � %d/%d NFA states � %d/%d base-def entries created � %d/%d character classes needed %d/%d words of storage, %d reused � %d/%d equivalence classes created � %d/%d meta-equivalence classes created � %d/%d start conditions � %d/%d unique/duplicate transitions � Beginning-of-line patterns used � Compressed tables always back-up � No backing up � no character classes � scanner options: -� and may be the actual source of other reported performance penalties � associated rule line numbers:� out-transitions: �%%option yylineno entails a performance penalty ONLY on rules that can match newline characters �%array incompatible with -+ option�%d backing up (non-accepting) states. �%option yyclass only meaningful for C++ scanners�%option yylineno cannot be used with REJECT�%s %s �%s version %s usage statistics: �%s: fatal internal error, %s �********** end of dump �*Something Weird* - tok: %d val: %d �-Cf and -CF are mutually exclusive�-Cf/-CF and -Cm don't make sense together�-Cf/-CF and -I are incompatible�-Cf/-CF are incompatible with lex-compatibility mode�-I (interactive) entails a minor performance penalty �-l AT&T lex compatibility option entails a large performance penalty �-s option given but default rule can be matched�Allocation of buffer for line directive failed�Allocation of buffer for m4 def failed�Allocation of buffer for m4 undef failed�Allocation of buffer to print string failed�Can't use -+ with -CF option�Can't use -+ with -l option�Can't use --reentrant or --bison-bridge with -l option�Can't use -f or -F with -l option�Compressed tables always back up. �Could not write ecstbl�Could not write eoltbl�Could not write ftbl�Could not write ssltbl�Could not write yyacc_tbl�Could not write yyacclist_tbl�Could not write yybase_tbl�Could not write yychk_tbl�Could not write yydef_tbl�Could not write yymeta_tbl�Could not write yynultrans_tbl�Could not write yynxt_tbl�Could not write yynxt_tbl[][]�Definition name too long �Definition value for {%s} too long �EOF encountered inside an action�EOF encountered inside pattern�End Marker �Generates programs that perform pattern-matching on text. Table Compression: -Ca, --align trade off larger tables for better memory alignment -Ce, --ecs construct equivalence classes -Cf do not compress tables; use -f representation -CF do not compress tables; use -F representation -Cm, --meta-ecs construct meta-equivalence classes -Cr, --read use read() instead of stdio for scanner input -f, --full generate fast, large scanner. Same as -Cfr -F, --fast use alternate table representation. Same as -CFr -Cem default compression (same as --ecs --meta-ecs) Debugging: -d, --debug enable debug mode in scanner -b, --backup write backing-up information to %s -p, --perf-report write performance report to stderr -s, --nodefault suppress default rule to ECHO unmatched text -T, --trace %s should run in trace mode -w, --nowarn do not generate warnings -v, --verbose write summary of scanner statistics to stdout --hex use hexadecimal numbers instead of octal in debug outputs Files: -o, --outfile=FILE specify output filename -S, --skel=FILE specify skeleton file -t, --stdout write scanner on stdout instead of %s --yyclass=NAME name of C++ class --header-file=FILE create a C header file in addition to the scanner --tables-file[=FILE] write tables to FILE Scanner behavior: -7, --7bit generate 7-bit scanner -8, --8bit generate 8-bit scanner -B, --batch generate batch scanner (opposite of -I) -i, --case-insensitive ignore case in patterns -l, --lex-compat maximal compatibility with original lex -X, --posix-compat maximal compatibility with POSIX lex -I, --interactive generate interactive scanner (opposite of -B) --yylineno track line count in yylineno Generated code: -+, --c++ generate C++ scanner class -Dmacro[=defn] #define macro defn (default defn is '1') -L, --noline suppress #line directives in scanner -P, --prefix=STRING use STRING as prefix instead of “yy” -R, --reentrant generate a reentrant C scanner --bison-bridge scanner for bison pure parser. --bison-locations include yylloc support. --stdinit initialize yyin/yyout to stdin/stdout --noansi-definitions old-style function definitions --noansi-prototypes empty parameter list in prototypes --nounistd do not include <unistd.h> --noFUNCTION do not generate a particular FUNCTION Miscellaneous: -c do-nothing POSIX option -n do-nothing POSIX option -? -h, --help produce this help message -V, --version report %s version �Input line too long �Internal error. flexopts are malformed. �No backing up. �Option line too long �Options -+ and --reentrant are mutually exclusive.�REJECT cannot be used with -f or -F�REJECT entails a large performance penalty �State #%d is non-accepting - �Try ‘%s --help’ for more information. �Unknown error=(%d) �Unmatched ‘{’�Unrecognized option ‘%s’ �Usage: %s [OPTIONS] [FILE]... �Usage: %s [OPTIONS]... �Variable trailing context rule at line %d �Variable trailing context rules entail a large performance penalty �[:^lower:] is ambiguous in case insensitive scanner�[:^upper:] ambiguous in case insensitive scanner�allocation of macro definition failed�allocation of sko_stack failed�attempt to increase array size failed�bad <start condition>: %s�bad character ‘%s’ detected in check_char()�bad character class�bad character class expression: %s�bad character inside {}'s�bad character: %s�bad iteration values�bad line in skeleton file�bad start condition list�bad state type in mark_beginning_as_normal()�bad transition character detected in sympartition()�bison bridge not supported for the C++ scanner.�can't open %s�can't open skeleton file %s�consistency check failed in epsclosure()�could not create %s�could not create backing-up info file %s�could not create unique end-of-buffer state�could not write tables header�dangerous trailing context�empty machine in dupmachine()�error closing backup file %s�error closing output file %s�error closing skeleton file %s�error creating header file %s�error deleting output file %s�error writing backup file %s�error writing output file %s�fatal parse error�found too many transitions in mkxtion()�incomplete name definition�input error reading skeleton file %s�input rules are too complicated (>= %d NFA states)�iteration value must be positive�malformed ‘%top’ directive�memory allocation failed in allocate_array()�memory allocation failed in yy_flex_xmalloc()�memory allocation failure in xstrdup()�missing quote�missing }�name “%s” ridiculously long�name defined twice�negative range in character class�option ‘%s’ doesn't allow an argument �option ‘%s’ is ambiguous �option ‘%s’ requires an argument �premature EOF�rule cannot be matched�scanner requires -8 flag to use the character %s�start condition %s declared twice�state # %4d �state # %d accepts: �state # %d accepts: [%d] �state # %d: �symbol table memory allocation failed�the character range [%c-%c] is ambiguous in a case-insensitive scanner�too many rules (> %d)!�trailing context used twice�unbalanced parenthesis�undefined definition {%s}�unknown -C option ‘%c’�unknown error processing section 1�unrecognized %%option: %s�unrecognized ‘%’ directive�unrecognized rule�variable trailing context rules cannot be used with -f or -F�yymore() entails a minor performance penalty �