<?xml version="1.0" encoding="utf-8"?><?xml-stylesheet href='http://feeds.feedsky.com/styles/temp01.xsl' type='text/xsl' ?><!--这是一个由Feedsy提供技术支持的Feed，为了提高读者阅读的体验，以及满足用户美化自己Feed的需要，我们设计了多种精美的Feed模板，提供给大家选择，所有最终呈现出来的样式，皆由用户自愿选择使用，未经许可，任何团体和个人，请不要擅自修改样式或者盗用，这是对于用户选择权的尊重。--><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:fs="http://www.feedsky.com/namespace/feed" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0"><channel><atom:link href="http://feeds.feedsky.com/csdn.net/qingcairousi" type="application/rss+xml" rel="self"></atom:link><fs:self_link href="http://feeds.feedsky.com/csdn.net/qingcairousi" type="application/rss+xml"></fs:self_link><lastBuildDate>Wed, 19 May 2010 14:42:00 GMT</lastBuildDate><title>青菜肉丝的专栏</title><description>CSDN博客聚合服务</description><link>http://blog.csdn.net/blogrss.aspx?username=qingcairousi</link><item><title>wxpython.BoxSizer笔记</title><link>http://blog.csdn.net/qingcairousi/archive/2010/05/19/5609551.aspx</link><description>&lt;br /&gt;Sizer是wxWidget的一个重要的布局规划工具。&lt;br /&gt;其中的Add函数中的proportion参数是一个很重要的参数。&lt;br /&gt;proportion=0时，Add的item的大小不会被Sizer调整,即使flag中有wx.EXPAND。&lt;br /&gt;Sizer的Item中，除了Add时proportion=0的item，其余的item的分配的原则为：&lt;br /&gt;item占比例=item在Add时proportion的值/所有item的proportion的值的和&lt;img src=&quot;http://www1.feedsky.com/t1/368375492/qingcairousi/csdn.net/s.gif?r=http://blog.csdn.net/qingcairousi/archive/2010/05/19/5609551.aspx&quot; border=&quot;0&quot; height=&quot;0&quot; width=&quot;0&quot; style=&quot;position:absolute&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375492/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375492/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Wed, 19 May 2010 22:42:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2010/05/19/5609551.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2010/05/19/5609551.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375492/1072366</fs:itemid></item><item><title>boost.spirit用户手册翻译（35）：重构分析器</title><link>http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084213.aspx</link><description>Refactoring Parsers
重构分析器
















There are three types of Refactoring Parsers implemented right now, which help to abstract common parser refactoring tasks. Parser refactoring means, that a concrete parser construct is replaced (refactored) by another very similar parser construct. Two of the Refactoring Parsers described here (refactor_unary_parser and refactor_action_parser) are introduced to allow a simple and more expressive notation while using Confix Parsers and List Parsers&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375493/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375493/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 05 Feb 2008 10:51:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084213.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084213.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375493/1072366</fs:itemid></item><item><title>boost.spirit用户手册翻译（36）：正则表达式分析器</title><link>http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084215.aspx</link><description>Regular Expression Parser
正则表达式分析器















Regular expressions are a form of pattern-matching that are often used in text processing. Many users will be familiar with the usage of regular expressions. Initially there were the Unix utilities grep, sed and awk, and the programming language perl, each of which make extensive use of regular expressions. Today the usage of such regular expressions is integrated in many more available systems.
正则表达式是经常在字符处理中使用模式匹配的一种形式。很多用户对正则表达式都很熟悉。最初是U&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375494/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375494/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 05 Feb 2008 10:51:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084215.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084215.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375494/1072366</fs:itemid></item><item><title>boost.spirit用户手册翻译（37）：范围锁</title><link>http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084217.aspx</link><description>Scoped Lock
范围锁















scoped_lock_d
The scoped_lock_d directive constructs a parser that locks a mutex during the attempt to match the contained parser.
scoped_lock_d定向器产生一个在尝试匹配所包含的分析器时锁定一个临界区的分析器。
Syntax:
语法：

    scoped_lock_d(mutex&amp;)[body-parser]

Note, that nesting scoped_lock_d directives bears the risk of deadlocks since the order of locking depends on the grammar used and may even depend on the input being parsed. Locking order has to be consistent within an applicatio&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375495/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375495/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 05 Feb 2008 10:51:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084217.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/02/05/2084217.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375495/1072366</fs:itemid></item><item><title>boost.spirit用户手册翻译（34）：仿函数分析器</title><link>http://blog.csdn.net/qingcairousi/archive/2008/02/01/2076434.aspx</link><description>Functor Parser
仿函数分析器















The simplest way to write your hand coded parser that works well with the rest of the Spirit library is to simply write a functor parser.
使得你所写的代码能和Spirit其他部分合作愉快的最简单的方法就是简单地写一个仿函数分析器
A functor parser is expected to have the interface:
一个仿函数分析器应该有如下接口：

    struct functor
    {
        typedef T result_t;

        template &lt;typename ScannerT&gt;
        std::ptrdiff_t
        operator()(ScannerT const&amp; scan, result_t&amp; result) const;
    };&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375496/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375496/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Fri, 01 Feb 2008 10:35:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/02/01/2076434.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/02/01/2076434.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375496/1072366</fs:itemid></item><item><title>boost.spirit用户手册翻译（33）：列表分析器</title><link>http://blog.csdn.net/qingcairousi/archive/2008/02/01/2076392.aspx</link><description>List Parsers
列表分析器
















List Parsers are generated by the special predefined parser generator object list_p, which generates parsers recognizing list structures of the type
列表分析器生成自特殊的预定义分析器生成器对象list_p，所生成的分析器识别如下类型的列表

    item &gt;&gt; *(delimiter &gt;&gt; item) &gt;&gt; !end

where item is an expression, delimiter is a delimiter and end is an optional closing expression. As you can see, the list_p generated parser does not recognize empty lists, i.e. the parser must find at l&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375497/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375497/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Fri, 01 Feb 2008 10:23:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/02/01/2076392.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/02/01/2076392.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375497/1072366</fs:itemid></item><item><title>boost.spirit用户手册翻译（32）：片段分析器</title><link>http://blog.csdn.net/qingcairousi/archive/2008/01/25/2065648.aspx</link><description>Confix Parsers
片段分析器
















Confix Parsers 
片段分析器
Confix Parsers recognize a sequence out of three independent elements: an opening, an expression and a closing. A simple example is a C comment:
片段分析器识别一个包含三个元素的序列：一个开头，一个表达式和一个结尾。简单的例子就是C的注释：

    /* This is a C comment */

which could be parsed through the following rule definition:
它可以用下面定义的规则来分析：

    rule&lt;&gt; c_comment_rule
        =   confix_p(&quot;/*&quot;, *anychar_p, &quot;*/&quot;)
        ;

The confix_p parser generator should be used&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375498/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375498/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Fri, 25 Jan 2008 16:45:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/01/25/2065648.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/01/25/2065648.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375498/1072366</fs:itemid></item><item><title>boost.spirit用户手册翻译（31）：字符集</title><link>http://blog.csdn.net/qingcairousi/archive/2008/01/22/2060246.aspx</link><description>Character Sets
字符集















The character set chset matches a set of characters over a finite range bounded by the limits of its template parameter CharT. This class is an optimization of a parser that acts on a set of single characters. The template class is parameterized by the character type CharT and can work efficiently with 8, 16 and 32 and even 64 bit characters.
字符集分析器chset匹配由它的模板参数CharT所限制的范围内的有限字符子集。这个分析器针对单个字符的集合的分析而优化。这个模板类由字符类CharT参数化并且可以使用8、16和32甚至64位的字符。

    template&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375499/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375499/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 22 Jan 2008 23:07:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/01/22/2060246.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/01/22/2060246.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375499/1072366</fs:itemid></item><item><title>boost.sprit用户手册翻译（30）：循环</title><link>http://blog.csdn.net/qingcairousi/archive/2008/01/18/2051550.aspx</link><description>Loops
循环















So far we have introduced a couple of EBNF operators that deal with looping. We have the + positive operator, which matches the preceding symbol one (1) or more times, as well as the Kleene star * which matches the preceding symbol zero (0) or more times.
到目前为止我们已经介绍了一些针对循环的EBNF操作符。我们有+加号，匹配（1）到任意多次，我们也有克林星*，匹配零到任意多次。
Taking this further, we may want to have a generalized loop operator. To some this may seem to be a case of overkill. Yet there are grammars that are&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375500/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375500/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Fri, 18 Jan 2008 15:43:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/01/18/2051550.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/01/18/2051550.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375500/1072366</fs:itemid></item><item><title>boost.spirit用户手册翻译（29）：转义字符分析器</title><link>http://blog.csdn.net/qingcairousi/archive/2008/01/17/2047903.aspx</link><description>Escape Character Parser
转义字符分析器















The Escape Character Parser is a utility parser, which parses escaped character sequences used in C/C++, LEX or Perl regular expressions. Combined with the confix_p utility parser, it is useful for parsing C/C++ strings containing double quotes and other escaped characters:
转义字符分析器属于工具分析器，用于分析C/C++、LEX或Perl正则表达式中的转移字符串。将之与confix_p工具分析器共同使用，在分析C/C++中由引号引起的字符串方面很有用。

    confix_p('&quot;', *c_escape_ch_p, '&quot;')

There are two different types of the Es&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/qingcairousi/368375501/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/qingcairousi/368375501/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Thu, 17 Jan 2008 09:02:00 +0800</pubDate><author>青菜肉丝</author><guid isPermaLink="false">http://blog.csdn.net/qingcairousi/archive/2008/01/17/2047903.aspx</guid><dc:creator>青菜肉丝</dc:creator><fs:srclink>http://blog.csdn.net/qingcairousi/archive/2008/01/17/2047903.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/qingcairousi/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/qingcairousi/~1072367/368375501/1072366</fs:itemid></item></channel></rss>
