Code Completion Design - Revision history

Ollydbg: add a new section

2014-09-08T15:22:31Z

add a new section

← Older revision		Revision as of 15:22, 8 September 2014
Line 237:		Line 237:

	Which means, if the tokenizer meet a string "AAAAA", then it will returned a string "BBBBB"		Which means, if the tokenizer meet a string "AAAAA", then it will returned a string "BBBBB"
			====directly replacement AAAAA -> Empty String====
			You can define a rule:
			AAAAA -> Empty String

			The token "AAAAA" is skipped when parsing.

	==== AAAAA -> +BBBBB====		==== AAAAA -> +BBBBB====
	For example, when		For example, when

2014-06-24T02:59:04Z

add a new user defined macro replacement rule AAAAA->@

@@ Line 332: / Line 332: @@
 cvMat * cvFyyy();
 </source>
 ==High level parser(Syntax Analysis)==

2014-02-17T15:16:42Z

Usefull Links: add parser links

← Older revision		Revision as of 15:16, 17 February 2014
Line 876:		Line 876:

	* LLVM's online tutorials on how to write a simple compiler [http://llvm.org/docs/tutorial/index.html LLVM Tutorial]		* LLVM's online tutorials on how to write a simple compiler [http://llvm.org/docs/tutorial/index.html LLVM Tutorial]

			* Roberto Raggi's new parser[https://github.com/robertoraggi/cplusplus cplusplus 5 My experimental C++ front end], note Roberto Raggi is the author of the parser for both Qtcreator and Kdeveloper IDE.

			* KDevelop are discussing clang now, see [http://milianw.de/blog/katekdevelop-sprint-2014-let-there-be-clang Kate/KDevelop Sprint 2014: Let There Be Clang \| Milian Wolff]

2013-12-01T14:37:21Z

Usefull Links: LLVM tutorials

← Older revision		Revision as of 14:37, 1 December 2013
Line 874:		Line 874:

	* [http://en.literateprograms.org/Radix_tree_(C) Radix tree (C) - LiteratePrograms]		* [http://en.literateprograms.org/Radix_tree_(C) Radix tree (C) - LiteratePrograms]

			* LLVM's online tutorials on how to write a simple compiler [http://llvm.org/docs/tutorial/index.html LLVM Tutorial]

2013-11-05T14:27:55Z

Usefull Links: add one link

← Older revision		Revision as of 14:27, 5 November 2013
Line 872:		Line 872:

	*[http://wiki.eclipse.org/CDT/designs/Overview_of_Parsing CDT/designs/Overview of Parsing].		*[http://wiki.eclipse.org/CDT/designs/Overview_of_Parsing CDT/designs/Overview of Parsing].

			* [http://en.literateprograms.org/Radix_tree_(C) Radix tree (C) - LiteratePrograms]

2013-10-06T06:23:10Z

How a new item is added to the tree: extend a node's edge

@@ Line 546: / Line 546: @@
 </source>
 Here, the middle node "physi" is added. the original node 1's lable is shorten to "cs", and a new node "ology" is added as a new child node to the middle node.
 ===How to query a Token by a keyword===

2013-10-06T06:05:13Z

how new item is added

← Older revision		Revision as of 06:05, 6 October 2013
Line 525:		Line 525:

	For more information, see the forum discussion here. [/index.php/topic,1696.0.html rickg22's SearchTree development] as a reference.		For more information, see the forum discussion here. [/index.php/topic,1696.0.html rickg22's SearchTree development] as a reference.

			===How a new item is added to the tree===
			When you add a new key (string) to the tree, some node should be splited, and new node need to be added. For example [/index.php/topic,1696.msg12617.html#msg12617 this post]show some details.

			Suppose we have two nodes in the tree, the node id is 0 (root node) and 1, the tree hold only one key string(item) "physics":
			<source lang = "cpp">
			Adding word: physics
			1 items in the tree
			- "" (0)
			\- "physics" (1)
			</source>
			Now, if another key string "physiology" is added to the tree, we now firstly check "physiology" is already in the tree, if not, we need to find the common string "physi", so the node 1 should be splited after the common string, so you get the following result.
			<source lang = "cpp">
			Adding word: physiology
			2 items in the tree
			- "" (0)
			\- "physi" (2)
			+- "cs" (1)
			\- "ology" (3)
			</source>
			Here, the middle node "physi" is added. the original node 1's lable is shorten to "cs", and a new node "ology" is added as a new child node to the middle node.

	===How to query a Token by a keyword===		===How to query a Token by a keyword===

2013-02-21T03:53:49Z

Structure of CodeCompletion plugin: add some details.

@@ Line 51: / Line 51: @@
 ==Structure of CodeCompletion plugin==
 [[Image:CodeCompletionPluginStructure.png| Code completion plugin Structure]]
 ==Low level parser(Lexical analysis, Tokenize)==

2013-02-21T03:36:44Z

Mutexs and lockers in CC: macros and lockers

2013-02-21T03:22:58Z

new section: