MINI MINI MANI MO

Path : /usr/share/locale/vi/LC_MESSAGES/
Current File : //usr/share/locale/vi/LC_MESSAGES/flex.mo
Þ•§TßŒ
7	
AOh…/'Íõ.>S"_#‚¦ º Û*ü3'[z!ŽC°$ô)C%]"ƒ#¦ÊÛóFOn`"â&0,+]‰ ±Ï$ç")/Y4y5®Eä/*.Z&‰(°+Ù"6>!u"—ºÑèý.Lg›¶Õï
#' Kl‹:—Ò#(ç#$ $26$#i$+$¹$&×$þ$
% %:%Y%*q%Cœ%3à%0&%E&k&%Š&°&+Ê&ö&"
'-'G'Y'n'ˆ',¡'3Î'/(
2(@((\(…((™(+Â(î()'')O)m)Š)§)Æ)ä)**<*'N*v*$‘*2¶* é*
+,%+-R+
€+	Ž+˜+´+!Ç+&é+,!*,
L,Z,0q,!¢,Ä,Ñ,æ,-%
-F3-z-‘--Ç-"Þ-..6.<H.-…..³.Jâ0-1"<1!_1G1GÉ1E2!W2Fy24À2õ283G>3†3/ 3.Ð3Yÿ3fY4$À4å4M5VN5;¥5:á5$60A6"r6,•6Â6Õ6ó6I7/[7 ‹7f¬7>8DR8H—8Qà829,99.f9•98¬96å9H:Ce:l©:?;LV;P£;?ô;64<8k<?¤<8ä<6=†T=?Û=+>G>a>{>“>> Ê>ë>	?&?C?!a?ƒ?  ?Á?-à?9@+H@t@‡@˜O7°OèOúOTPJlP/·P;çPH#QlQƒQ"”Q,·Q!äQ<RBCRE†REÌR6S+IS6uS7¬SGäS,T%@T4fT›T ¬T-ÍT.ûT]*U>ˆUSÇUV,0VC]V¡V3·VCëV%/W%UWL{W2ÈW,ûW*(X1SX0…X-¶X(äX'
Y'5Y9]Y)—Y=ÁYKÿY.KZ-zZR¨Z?ûZ;[	V[`[)€[+ª[.Ö[\*$\&O\&v\:\BØ\]"0]'S]{]3]WÄ]^.<^,k^$˜^,½^6ê^:!_-\_]Š_(è_%ZC9F"1]dB!)‚Um:&aT§
-›+@H¦oi¥z[8—DŸŽ}fn2;YOl”„c<•NR=†‹€(_r^P
’ƒ*`J,06M L‘¤x£{'ˆ?bIe~V/A	GwWj‰Qp3¢t7œy 4Sv>KŠq\™|–‡sg¡5h˜XE“už.š…k#Œ$

********** 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 matchedAllocation of buffer for line directive failedAllocation of buffer for m4 def failedAllocation of buffer for m4 undef failedAllocation of buffer to print string failedCan't use -+ with -CF optionCan't use -+ with -l optionCan't use --reentrant or --bison-bridge with -l optionCan't use -f or -F with -l optionCompressed tables always back up.
Could not write ecstblCould not write eoltblCould not write ftblCould not write ssltblCould not write yyacc_tblCould not write yyacclist_tblCould not write yybase_tblCould not write yychk_tblCould not write yydef_tblCould not write yymeta_tblCould not write yynultrans_tblCould not write yynxt_tblCould not write yynxt_tbl[][]Definition name too long
Definition value for {%s} too long
EOF encountered inside an actionEOF encountered inside patternEnd 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

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 -FREJECT 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 scannerallocation of macro definition failedallocation of sko_stack failedattempt to increase array size failedbad <start condition>: %sbad character '%s' detected in check_char()bad character classbad character class expression: %sbad character inside {}'sbad character: %sbad iteration valuesbad line in skeleton filebad start condition listbad state type in mark_beginning_as_normal()bad transition character detected in sympartition()bison bridge not supported for the C++ scanner.can't open %scan't open skeleton file %sconsistency check failed in epsclosure()could not create %scould not create backing-up info file %scould not create unique end-of-buffer statecould not write tables headerdangerous trailing contextdynamic memory failure in copy_string()empty machine in dupmachine()error closing backup file %serror closing output file %serror closing skeleton file %serror creating header file %serror deleting output file %serror writing backup file %serror writing output file %sfatal parse errorfound too many transitions in mkxtion()incomplete name definitioninput error reading skeleton file %sinput rules are too complicated (>= %d NFA states)iteration value must be positivemalformed '%top' directivememory allocation failed in allocate_array()memory allocation failed in yy_flex_xmalloc()missing quotemissing }name "%s" ridiculously longname defined twicenegative range in character classoption `%s' doesn't allow an argument
option `%s' is ambiguous
option `%s' requires an argument
premature EOFrule cannot be matchedscanner requires -8 flag to use the character %sstart condition %s declared twicestate # %4d	state # %d accepts: state # %d accepts: [%d]
state # %d:
symbol table memory allocation failedthe character range [%c-%c] is ambiguous in a case-insensitive scannertoo many rules (> %d)!trailing context used twiceundefined definition {%s}unknown -C option '%c'unknown error processing section 1unrecognized %%option: %sunrecognized '%' directiveunrecognized rulevariable trailing context rules cannot be used with -f or -Fyymore() entails a minor performance penalty
Project-Id-Version: flex-2.5.36
Report-Msgid-Bugs-To: flex-devel@lists.sourceforge.net
POT-Creation-Date: 2012-07-22 20:48-0400
PO-Revision-Date: 2012-08-03 07:57+0700
Last-Translator: Tráº§n Ngá»c QuÃ¢n <vnwildman@gmail.com>
Language-Team: Vietnamese <translation-team-vi@lists.sourceforge.net>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 8bit
Language: vi
Plural-Forms: nplurals=1; plural=0
X-Generator: LocFactoryEditor 1.7b3
X-Poedit-Language: Vietnamese
X-Poedit-Country: VIET NAM
X-Poedit-SourceCharset: utf-8


********** báº¯t Ä‘áº§u Ä‘á»• NFA cÃ³ tÃ¬nh tráº¡ng báº¯t Ä‘áº§u lÃ  %d


Äá»• DFA:



Háº¡ng Ä‘á»™ tÆ°Æ¡ng Ä‘Æ°Æ¡ng:



Háº¡ng siÃªu tÆ°Æ¡ng Ä‘Æ°Æ¡ng:

 chuyá»ƒn tiáº¿p jam (bá»‹ trá»Ÿ ngáº¡i?): gáº·p káº¿t thÃºc táºp tin  %d (%d Ä‘Æ°á»£c lÆ°u) láº§n va cháº¡m vá»›i hash, %d DFA báº±ng nhau
  %d Ä‘ang sao lÆ°u cÃ¡c tÃ¬nh tráº¡ng (kiá»ƒu khÃ´ng cháº¥p nháºn)
  %d má»¥c nháºp báº£ng trá»‘ng
  %d tÃ¬nh tráº¡ng Ã©pxilÃ´ng (Îµ), %d tÃ¬nh tráº¡ng Ã©pxilÃ´ng Ä‘Ã´i
  %d proto (váºt Ä‘áº§u tiÃªn) Ä‘Ã£ Ä‘Æ°á»£c táº¡o
  %d quy táº¯c
  cáº§n thiáº¿t %d táºp há»£p Ä‘iá»u phÃ¢n chia láº¡i
  %d cáº·p tÃ¬nh tráº¡ng/tÃ¬nh tráº¡ng káº¿ tiáº¿p Ä‘Ã£ Ä‘Æ°á»£c táº¡o
  %d má»¥c nháºp báº£ng
  %d máº«u Ä‘Ã£ Ä‘Æ°á»£c táº¡o, %d láº§n dÃ¹ng
  cáº§n thiáº¿t tá»•ng má»¥c nháºp báº£ng %d
  %d/%d (tá»‘i Ä‘a %d) má»¥c nháºp nxt-chk (kiá»ƒm tra káº¿ tiáº¿p) Ä‘Ã£ Ä‘Æ°á»£c táº¡o
  %d/%d (tá»‘i Ä‘a %d) má»¥c nháºp biá»ƒu máº«u nxt-chk (kiá»ƒm tra káº¿ tiáº¿p) Ä‘Ã£ Ä‘Æ°á»£c táº¡o
  %d/%d tÃ¬nh tráº¡ng DFA (%d tá»«)
  %d/%d tÃ¬nh tráº¡ng NFA
  %d/%d má»¥c nháºp base-def (Ä‘á»‹nh nghÄ©a cÆ¡ báº£n) Ä‘Ã£ Ä‘Æ°á»£c táº¡o
  %d/%d háº¡ng ky tá»± cáº§n thiáº¿t %d/%d tá»« sá»©c chá»©a, %d Ä‘Æ°á»£c dÃ¹ng láº¡i
  %d/%d háº¡ng kiá»ƒu tÆ°Æ¡ng Ä‘Æ°Æ¡ng Ä‘Ã£ Ä‘Æ°á»£c táº¡o
  %d/%d háº¡ng siÃªu tÆ°Æ¡ng Ä‘Æ°Æ¡ng Ä‘Ã£ Ä‘Æ°á»£c táº¡o
  %d/%d Ä‘iá»u kiá»‡n báº¯t Ä‘áº§u
  %d/%d viá»‡c chuyÃªn tiáº¿p duy nháº¥t/trÃ¹ng
  DÃ¹ng máº«u kiá»ƒu Ä‘áº§u dÃ²ng
  Báº£ng Ä‘Ã£ nÃ©n lÃºc nÃ o cÅ©ng sao lÆ°u
  KhÃ´ng sao lÆ°u
  khÃ´ng cÃ³ háº¡ng kÃ½ tá»±
  tÃ¹y chá»n bá»™ quÃ©t: â€” thÃ¬ cÃ³ láº½ tháºt gÃ¢y ra trÆ°á»ng há»£p giáº£m hiá»‡u suáº¥t khÃ¡c
 sá»‘ thá»© tá»± dÃ²ng quy táº¯c tÆ°Æ¡ng á»©ng: viá»‡c chuyá»ƒn tiáº¿p xuáº¥t: %%tÃ¹y chá»n "yylineno" giáº£m hiá»‡u suáº¥t CHá»ˆ vá»›i quy táº¯c khá»›p vá»›i kÃ½ tá»± dÃ²ng má»›i
"%array" (máº£ng) khÃ´ng tÆ°Æ¡ng thÃch vá»›i tÃ¹y chá»n "-+"%d Ä‘ang sao lÆ°u cÃ¡c tÃ¬nh tráº¡ng (kiá»ƒu khÃ´ng cháº¥p nháºn).
%option (tÃ¹y chá»n) "yyclass" chá»‰ cÃ³ Ã½ nghÄ©a vá»›i bá»™ quÃ©t C++KhÃ´ng cho phÃ©p dÃ¹ng %option (tÃ¹y chá»n) "yylineno" vá»›i REJECT (Ä‘uá»•i ra)%s %s
%s phiÃªn báº£n %s thá»‘ng kÃª sá» dá»¥ng:
%s: gáº·p lá»—i nÃ´i bá»™ nghiÃªm trá»ng, %s
********** Ä‘á»• xong
â€¢ Äiá»u láº¡ â€¢ â€” hiá»‡u bÃ i: %d giÃ¡ trá»‹: %d
Hai tÃ¹y chá»n "-Cf" and "-CF" loáº¡i tá»« láº«n nhauHai tÃ¹y chá»n "-Cf/-CF" vÃ  "-Cm" vá»›i nhau thÃ¬ khÃ´ng cÃ³ Ã½ nghÄ©aHai tÃ¹y chá»n "-Cf/-CF" vÃ  "-I" khÃ´ng tÆ°Æ¡ng thÃch vá»›i nhauTÃ¹y chá»n "-Cf/-CF" khÃ´ng tÆ°Æ¡ng thÃch vá»›i cháº¿ Ä‘á»™ "lex-compatibility" (tÆ°Æ¡ng thÃch vá»›i lex)TÃ¹y chá»n "-I" (tÆ°Æ¡ng tÃ¡c) giáº£m hiá»‡u suáº¥t má»™t Ãt
TÃ¹y chá»n kiá»ƒu tÆ°Æ¡ng thÃch lex AT&T "-l"  ráº¥t giáº£m hiá»‡u suáº¥t
Ä‘Æ°a ra tÃ¹y chá»n "-s" cÃ²n quy táº¯c máº·c Ä‘á»‹nh cÃ³ thá»ƒ Ä‘Æ°á»£c khá»›pViá»‡c phÃ¢n bá»• bá»™ Ä‘á»‡m cho chá»‰ thá»‹ dÃ²ng gáº·p lá»—iViá»‡c phÃ¢n bá»• bá»™ Ä‘á»‡m cho 'm4 def' gáº·p lá»—iViá»‡c phÃ¢n bá»• bá»™ Ä‘á»‡m cho 'm4 undef' gáº·p lá»—iViá»‡c phÃ¢n bá»• bá»™ Ä‘á»‡m cho lá»‡nh in chuá»—i gáº·p lá»—iKhÃ´ng thá»ƒ dÃ¹ng kÃ½ tá»± "-+" vá»›i tÃ¹y chá»n "-CF"KhÃ´ng thá»ƒ dÃ¹ng kÃ½ tÆ° "-+" vá»›i tÃ¹y chá»n "-l"KhÃ´ng thá»ƒ dÃ¹ng Ä‘á»‘i sá»‘ "--reentrant" (Ä‘iá»u vÃ o láº¡i) hoáº·c "--bison-bridge" (chiáº¿c cáº§u bison) vá»›i tÃ¹y chá»n "-l"KhÃ´ng thá»ƒ dÃ¹ng cá» "-f" hoáº·c "-F" vá»›i tÃ¹y chá»n "-l"Báº£ng Ä‘Ã£ nÃ©n lÃºc nÃ o cÅ©ng sao lÆ°u.
KhÃ´ng thá»ƒ ghi "ecstbl"KhÃ´ng thá»ƒ ghi "eoltbl"KhÃ´ng thá»ƒ ghi "ftbl"KhÃ´ng thá»ƒ ghi "ssltbl"KhÃ´ng thá»ƒ ghi "yyacc_tbl"KhÃ´ng thá»ƒ ghi "yyacclist_tbl"KhÃ´ng thá»ƒ ghi "yybase_tbl"KhÃ´ng thá»ƒ ghi "yychk_tbl"KhÃ´ng thá»ƒ ghi "yydef_tbl"KhÃ´ng thá»ƒ ghi "yymeta_tbl"KhÃ´ng thá»ƒ ghi "yynultrans_tbl"KhÃ´ng thá»ƒ ghi "yynxt_tbl"KhÃ´ng thá»ƒ ghi "yynxt_tbl[][]"TÃªn Ä‘á»‹nh nghÄ©a quÃ¡ dÃ i
GiÃ¡ trá»‹ Ä‘á»‹nh nghÄ©a cho {%s} quÃ¡ dÃ i
gáº·p káº¿t thÃºc táºp tin á»Ÿ trong má»™t hÃ nh Ä‘á»™nggáº·p káº¿t thÃºc táºp tin á»Ÿ trong máº«uDáº¥u káº¿t thÃºc
Táº¡o ra chÆ°Æ¡ng trÃ¬nh thá»±c hiá»‡n tiáº¿n trÃ¬nh khá»›p máº«u trong Ä‘oáº¡n chá»¯.

CÃ¡ch nÃ©n báº£ng:
  -Ca, --align		thoáº£ hiá»‡p giá»¯a báº£ng lá»›n hÆ¡n
	vÃ  Ä‘á»™ _canh lá»_ bá»™ nhá»› khÃ¡ hÆ¡n
  -Ce, --ecs        	cáº¥u táº¡o háº¡ng kiá»ƒu tÆ°Æ¡ng Ä‘Æ°Æ¡ng
  -Cf               	khÃ´ng nÃ©n báº£ng; dÃ¹ng sá»± tiÃªu biá»ƒu "-f"
  -CF               	khÃ´ng nÃ©n báº£ng; dÃ¹ng sá»± cÃ¡ch tiÃªu biá»ƒu "-F"
  -Cm, --meta-ecs   cáº¥u táº¡o háº¡ng kiá»ƒu _siÃªu_ tÆ°Æ¡ng Ä‘Æ°Æ¡ng
  -Cr, --read       	dÃ¹ng chá»©c nÄƒng read() (_Ä‘á»c_) thay tháº¿
				thiáº¿t bá»‹ nháºp/xuáº¥t chuáº©n Ä‘á»ƒ nháºp bá»™ quÃ©t
  -f, --full      	táº¡o ra bá»™ quÃ©t nhanh vÃ  lá»›n; báº±ng -Cfr (_Ä‘áº§y Ä‘á»§_)
  -F, --fast    	dÃ¹ng sá»± tiÃªu biá»ƒu báº£ng xen káº½; báº±ng -CFr (_nhanh_)
  -Cem          	phÆ°Æ¡ng phÃ¡p nÃ©n máº·c Ä‘á»‹nh;
	báº±ng "--ecs" "--meta-ecs")

Gá»¡ lá»—i:
  -d, --debug             	báºt cháº¿ Ä‘á»™ _gá»¡ lá»—i_ trong bá»™ quÃ©t
  -b, --backup            	ghi thÃ´ng tin _sao lÆ°u_ vÃ o %s
  -p, --perf-report       	ghi _thÃ´ng bÃ¡o hiá»‡u suáº¥t_ vÃ o thiáº¿t bá»‹ lá»—i chuáº©n
  -s, --nodefault   	thu há»“i quy táº¯c _máº·c Ä‘á»‹nh_
	Ä‘á»ƒ ECHO (vá»ng) Ä‘oáº¡n chÆ°a khá»›p
  -T, --trace             	%s nÃªn cháº¡y trong cháº¿ Ä‘á»™ theo _dáº¥u váº¿t_
  -w, --nowarn            	_khÃ´ng_ táº¡o ra lá»i _cáº£nh bÃ¡o_
  -v, --verbose   	ghi tÃ³m táº¯t cÃ¡c thá»‘ng kÃª bá»™ quÃ©t
				vÃ o thiáº¿t bá»‹ xuáº¥t chuáº©n (_chi tiÃªt_)

Táºp tin:
  -o, --outfile=Táº¬P_TIN      		ghi rÃµ tÃªn _táºp tin xuáº¥t_
  -S, --skel=Táº¬P_TIN         		ghi rÃµ táºp tin _khung sÆ°á»n_
  -t, --stdout            		ghi bá»™ quet ra _thiáº¿t bá»‹ xuáº¥t chuáº©n_
	thay tháº¿ ra %s
      --yyclass=TÃŠN      			tÃªn cá»§a _háº¡ng_ C++
      --header-file=Táº¬P_TIN   táº¡o _táºp tin pháº§n Ä‘áº§u_ C thÃªm vÃ o bá»™ quÃ©t
      --tables-file[=Táº¬P_TIN] 		ghi cÃ¡c báº£ng vÃ o Táº¬P_TIN nÃ y

á»¨ng xá» cá»§a bá»™ quÃ©t:
  -7, --7bit              		táº¡o ra bá»™ quÃ©t kiá»ƒu 7-bit
  -8, --8bit              		táº¡o ra bá»™ quÃ©t kiá»ƒu 8-bit
  -B, --batch             	táº¡o ra bá»™ quÃ©t _bÃ³_ (ngÆ°á»£c vá»›i tÃ¹y chá»n "-I")
  -i, --case-insensitive		_bá» qua chá»¯ HOA/thÆ°á»ng_ trong máº«u
  -l, --lex-compat      		Ä‘á»™ _tÆ°Æ¡ng thÃch_ tá»‘i Ä‘a vá»›i lex gá»‘c
  -X, --posix-compat      	Ä‘á»™ _tÆ°Æ¡ng thÃch_ tá»‘i Ä‘a vá»›i lex _POSIX_
  -I, --interactive       	táº¡o ra bá»™ quÃ©t _tÆ°Æ¡ng tÃ¡c_
	(ngÆ°á»£c vá»›i tÃ¹y chá»n "-B")
      --yylineno          		theo dÃµi sá»‘ Ä‘áº¿m sá»‘ dÃ²ng trong yylineno

MÃ£ Ä‘Ã£ táº¡o ra :
  -+,  --c++               	táº¡o ra hang bá»™ quÃ©t kiá»ƒu C++
  -Dmacro[=lá»i_Ä‘á»‹nh_nghÄ©a]    	_Ä‘á»‹nh nghÄ©a_ bá»™ lá»‡nh #define
					(lá»i Ä‘á»‹nh nghÄ©a máº·c Ä‘á»‹nh lÃ  "1")
  -L,  --noline            	thu há»“i cÃ¡c chá»‰ thá»‹ #line trong bá»™ quÃ©t
	(_khÃ´ng dÃ²ng_)
  -P,  --prefix=CHUá»–I   dÃ¹ng CHUá»–I nÃ y lÃ  _tiá»n tá»‘_ thay tháº¿ "yy"
  -R,  --reentrant         	táº¡o ra má»™t bá»™ quÃ©t C kiá»ƒu _vÃ o láº¡i_
       --bison-bridge      bá»™ quÃ©t cho trÃ¬nh phÃ¢n tÃ¡ch thuáº§n tuÃ½ kiá»ƒu bison.
	(_cáº§u_)
       --bison-locations   	gá»“m kháº£ nÄƒng há»— trá»£ yylloc (_Ä‘á»‹a Ä‘iá»ƒm_).
       --stdinit           	khá»Ÿi Ä‘á»™ng yyin/yyout vÃ o thiáº¿t bá»‹ nháºp/xuáº¥t chuáº©n
       --noansi-definitions  	_lá»i Ä‘á»‹nh nghÄ©a_ chá»©c nÄƒng kiá»ƒu cÅ©
	(_khÃ´ng ANSI_)
       --noansi-prototypes  	danh sÃ¡ch tham sá»‘ trá»‘ng trong _váºt Ä‘áº§u tiÃªn_
					(_khÃ´ng ANSI_)
       --nounistd          		_khÃ´ng_ bao gá»“m <unistd.h>
       --noCHá»¨C_NÄ‚NG 		khÃ´ng táº¡o ra má»™t CHá»¨C NÄ‚NG cÃ¡ biá»‡t

Láº·t váº·t:
  -c                      	tÃ¹y chá»n POSIX khÃ´ng lÃ m gÃ¬
  -n                      	tÃ¹y chá»n POSIX khÃ´ng lÃ m gÃ¬
  -?
  -h, --help         	hiá»ƒn thá»‹ _trá»£ giÃºp_ nÃ y
  -V, --version     	thÃ´ng bÃ¡o phiÃªn báº£n %s
dÃ²ng nháºp quÃ¡ dÃ i
Gáº·p lá»—i ná»™i bá»™ vÃ¬ nhá»¯ng flexopt dáº¡ng sai.
KhÃ´ng sao lÆ°u.
dÃ²ng tÃ¹y chá»n quÃ¡ dÃ i
Hai tÃ¹y chá»n "- +" vÃ  "--reentrant" (Ä‘iá»u vÃ o láº¡i) loáº¡i tá»« láº«n nhau.KhÃ´ng cho phÃ©p dÃ¹ng REJECT (Ä‘uá»•i ra) vá»›i tÃ¹y chá»n "-f" hay "-F"REJECT (Ä‘uá»•i ra) ráº¥t giáº£m hiá»‡u suáº¥t
TÃ¬nh tráº¡ng #%d khÃ´ng pháº£i lÃ  kiá»ƒu cháº¥p nháºn -
HÃ£y thá» lá»‡nh "%s --help" (trá»£ giÃºp) Ä‘á»ƒ xem thÃªm thÃ´ng tin.
KhÃ´ng rÃµ lá»—i=(%d)
ChÆ°a khá»›p "{"KhÃ´ng nháºn ra tÃ¹y chá»n "%s"
Sá» dá»¥ng: %s [TUY_CHá»ŒN] [Táº¬P_TIN]...
Sá» dá»¥ng: %s [TÃ™Y_CHá»ŒN]...
Gáº·p quy táº¯c ngá»¯ cáº£nh theo sau biáº¿n táº¡i dÃ²ng %d
Quy táº¯c ngá»¯ cáº£nh theo sau biáº¿n ráº¥t giáº£m hiá»‡u suáº¥t
[:^lower:] lÃ  mÆ¡ há»“ trong bá»™ quÃ©t bá» qua chá»¯ HOA/thÆ°á»ng[:^upper:] lÃ  mÆ¡ há»“ trong bá»™ quÃ©t bá» qua chá»¯ HOA/thÆ°á»ngviá»‡c phÃ¢n bá»• cho Ä‘á»‹nh nghÄ©a macro gáº·p lá»—iviá»‡c phÃ¢n bá»• cho sko_stack gáº·p lá»—iviá»‡c thá» tÄƒng kÃch cá»¡ máº£ng Ä‘Ã£ tháº¥t báº¡i<start condition> (Ä‘iá»‡u kiá»‡n báº¯t Ä‘áº§u) sai: %sphÃ¡t hiá»‡n kÃ½ tá»± sai "%s" trong check_char() (kiá»ƒm tra kÃ½ tá»±)háº¡ng kÃ½ tá»± saibiá»ƒu thá»©c háº¡ng kÃ½ tá»± sai: %scÃ³ kÃ½ tá»± sai á»Ÿ trong hai dáº¥u ngoáº·c mÃ³c {}kÃ½ tá»± sai: %sgáº·p giÃ¡ trá»‹ láº·p láº¡i saigáº·p dÃ²ng sai trong táºp tin khung sÆ°á»ndanh sÃ¡ch Ä‘iá»u kiá»‡n báº¯t Ä‘áº§u lÃ  saikiá»ƒu tÃ¬nh tráº¡ng sai trong mark_beginning_as_normal() (Ä‘Ã¡nh dáº¥u Ä‘áº§u lÃ  thÆ°á»ng)phÃ¡t hiá»‡n kÃ½ tá»± chuyá»ƒn tiáº¿p sai trong sympartition()bison bridge (chiáº¿c cáº§u bison) khÃ´ng Ä‘Æ°á»£c há»— trá»£ vá»›i bá»™ quÃ©t C++.khÃ´ng thá»ƒ má»Ÿ %skhÃ´ng thá»ƒ má»Ÿ táºp tin khung sÆ°á»n %sviá»‡c kiá»ƒm tra sá»± thá»‘ng nháº¥t bá»‹ lá»—i trong epsclosure()khÃ´ng thá»ƒ táº¡o %skhÃ´ng thá»ƒ táº¡o táºp tin thÃ´ng tin sao lÆ°u %skhÃ´ng thá»ƒ táº¡o tÃ¬nh tráº¡ng káº¿t thÃºc bá»™ Ä‘á»‡m duy nháº¥tkhÃ´ng thá»ƒ ghi pháº§n Ä‘áº§u báº£ngngá»¯ cáº£nh theo sau lÃ  nguy hiá»ƒmbá»™ nhá»› Ä‘á»™ng Ä‘Ã£ tháº¥t báº¡i trong copy_string() (sao chÃ©p chuá»—i)mÃ¡y trá»‘ng trong dupmachine() (nhÃ¢n Ä‘Ã´i mÃ¡y)gáº·p lá»—i khi Ä‘Ã³ng táºp tin sao lÆ°u %sgáº·p lá»—i khi Ä‘Ã³ng táºp tin xuáº¥t %sgáº·p lá»—i khi Ä‘Ã³ng táºp tin khung sÆ°á»n %sgáº·p lá»—i khi táº¡o táºp tin pháº§n Ä‘áº§u %sgáº·p lá»—i khi xoÃ¡ bá» táºp tin xuáº¥t %sgÄƒp lá»—i khi ghi táºp tin sao lÆ°u %sgáº·p lá»—i khi ghi táºp tin xuáº¥t %sgáº·p lá»—i phÃ¢n tÃch nghiÃªm trá»nggáº·p quÃ¡ nhiá»u viá»‡c chuyá»ƒn tiáº¿p trong mkxtion()lá»i Ä‘inh nghÄ©a tÃªn chÆ°a hoÃ n táº¥tgáº·p lá»—i nháºp vÃ o khi Ä‘á»c táºp tin khung sÆ°á»n %scÃ¡c quy táº¯c nháºp vÃ o lÃ  quÃ¡ phá»©c táº¡p (â‰¥ %d tÃ¬nh tráº¡ng NFA)giÃ¡ trá»‹ láº·p láº¡i pháº£i lÃ  sá»‘ dÆ°Æ¡ngchá»‰ thá»‹ kiá»ƒu "%top" (Ä‘áº§u) dáº¡ng saiviá»‡c phÃ¢n chia bá»™ nhá»› bá»‹ lá»—i trong allocate_array() (phÃ¢n chia máº£ng)viá»‡c phÃ¢n chia bá»™ nhá»› bá»‹ lá»—i trong yy_flex_xmalloc()thiáº¿u dáº¥u trÃch dáº«nthiáº¿u }tÃªn "%s" lÃ  dÃ i nhá»‘ nhÄƒngtÃªn Ä‘Ã£ Ä‘Æ°á»£c xÃ¡c Ä‘á»‹nh hai láº§ngáº·p pháº¡m vá»‹ Ã¢m trong háº¡ng kÃ½ tá»±tÃ¹y chá»n "%s" khÃ´ng cho phÃ©p Ä‘á»‘i sá»‘
tÃ¹y chá»n "%s" lÃ  mÆ¡ há»“
tÃ¹y chá»n "%s" cáº§n Ä‘áº¿n Ä‘á»‘i sá»‘
gáº·p káº¿t thÃºc táºp tin quÃ¡ sá»›mquy táº¯c khÃ´ng thá»ƒ Ä‘Æ°á»£c khá»›pbá»™ quÃ©t cáº§n thiáº¿t cá» "-8" Ä‘á»ƒ dÃ¹ng kÃ½ tá»± %sÄ‘iá»u kiá»‡n báº¯t Ä‘áº§u %s Ä‘Ã£ Ä‘Æ°á»£c tuyÃªn bá»‘ hai láº§ntÃ¬nh tráº¡ng # %4d	tÃ¬nh tráº¡ng # %d cháº¥p nháºn: tÃ¬nh tráº¡ng # %d cháº¥p nháºn: [%d]
tÃ¬nh tráº¡ng # %d:
lá»—i phÃ¢n chia bá»™ nhá»› cá»§a báº£ng kÃ½ hiá»‡upháº¡m vá»‹ kÃ½ tá»± [%c-%c] lÃ  mÆ¡ há»“ trong bá»™ quÃ©t bá» qua chá»¯ HOA/thÆ°á»ngquÃ¡ nhiá»u quy táº¯c (> %d) !ngá»¯ cáº£nh theo sau Ä‘Æ°á»£c dÃ¹ng hai láº§nchÆ°a xÃ¡c Ä‘á»‹nh lá»i Ä‘á»‹nh nghÄ©a {%s}khÃ´ng rÃµ tÃ¹y chá»n "-C" lÃ  "%c"gáº·p lá»—i khÃ´ng rÃµ khi xá» lÃ½ pháº§n 1gáº·p tÃ¹y chá»n %% khÃ´ng Ä‘Æ°á»£c nháºn dáº¡ng: %sgáº·p chá»‰ thá»‹ kiá»ƒu "%" khÃ´ng Ä‘Æ°á»£c nháºn dáº¡nggáº·p quy táº¯c khÃ´ng Ä‘Æ°á»£c nháºn dáº¡ngkhÃ´ng cho phÃ©p dÃ¹ng quy táº¯c ngá»¯ cáº£nh theo sau biáº¿n vá»›i tÃ¹y chá»n "-f" hay "-F"yymore() giáº£m hiá»‡u suáº¥t má»™t Ãt
OHA YOOOO