You can subscribe to this list here.
2006 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(4) |
Jun
(35) |
Jul
(11) |
Aug
(5) |
Sep
|
Oct
(1) |
Nov
(2) |
Dec
|
---|---|---|---|---|---|---|---|---|---|---|---|---|
2007 |
Jan
(10) |
Feb
(33) |
Mar
(8) |
Apr
(60) |
May
(40) |
Jun
(13) |
Jul
(3) |
Aug
(10) |
Sep
|
Oct
|
Nov
|
Dec
|
2008 |
Jan
(19) |
Feb
(14) |
Mar
(38) |
Apr
(3) |
May
(10) |
Jun
|
Jul
|
Aug
(6) |
Sep
(2) |
Oct
|
Nov
(13) |
Dec
(1) |
2009 |
Jan
(5) |
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2011 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
(2) |
Oct
|
Nov
|
Dec
|
2012 |
Jan
|
Feb
(1) |
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2013 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
|
Jun
(4) |
Jul
(1) |
Aug
|
Sep
(1) |
Oct
|
Nov
|
Dec
(6) |
2014 |
Jan
(2) |
Feb
(3) |
Mar
|
Apr
|
May
|
Jun
|
Jul
(11) |
Aug
(1) |
Sep
|
Oct
|
Nov
|
Dec
|
2015 |
Jan
(13) |
Feb
(5) |
Mar
(1) |
Apr
|
May
(1) |
Jun
|
Jul
(12) |
Aug
|
Sep
|
Oct
|
Nov
(2) |
Dec
(1) |
2016 |
Jan
(3) |
Feb
(5) |
Mar
(1) |
Apr
|
May
|
Jun
|
Jul
|
Aug
(2) |
Sep
|
Oct
(1) |
Nov
|
Dec
|
2017 |
Jan
(1) |
Feb
|
Mar
(2) |
Apr
(3) |
May
(2) |
Jun
|
Jul
(1) |
Aug
(1) |
Sep
(1) |
Oct
|
Nov
|
Dec
(2) |
2018 |
Jan
|
Feb
|
Mar
(1) |
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2019 |
Jan
|
Feb
(2) |
Mar
(1) |
Apr
(1) |
May
(2) |
Jun
|
Jul
|
Aug
(2) |
Sep
|
Oct
|
Nov
|
Dec
|
2020 |
Jan
(2) |
Feb
(3) |
Mar
|
Apr
(1) |
May
(4) |
Jun
|
Jul
(3) |
Aug
(1) |
Sep
(5) |
Oct
(9) |
Nov
(5) |
Dec
(3) |
2021 |
Jan
(1) |
Feb
(3) |
Mar
(2) |
Apr
(3) |
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
(1) |
Oct
(1) |
Nov
(2) |
Dec
(1) |
2022 |
Jan
(2) |
Feb
(4) |
Mar
(4) |
Apr
(2) |
May
(2) |
Jun
(4) |
Jul
(3) |
Aug
(5) |
Sep
(1) |
Oct
(3) |
Nov
(1) |
Dec
(2) |
2023 |
Jan
(2) |
Feb
|
Mar
(2) |
Apr
|
May
(3) |
Jun
(2) |
Jul
(1) |
Aug
(1) |
Sep
|
Oct
(1) |
Nov
(1) |
Dec
(1) |
2024 |
Jan
(1) |
Feb
(4) |
Mar
(7) |
Apr
(1) |
May
(1) |
Jun
(2) |
Jul
(1) |
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
From: Ulya <skv...@gm...> - 2020-08-02 19:49:50
|
Hi re2c users and contributors! This is a proposal to change re2c license to one of the widely recognized, OSI and FSF approved licenses (most likely MIT). To clarify, re2c will remain free and open source software, and this change should not affect the users. What is the current license? ---------------------------- Historically re2c uses a custom "public domain" license, worded as follows: Re2c is in the public domain. The data structures and algorithms used in re2c are all either taken from documents available to the general public or are inventions of the author. Programs generated by re2c may be distributed freely. Re2c itself may be distributed freely, in source or binary, unchanged or modified. Distributors may charge whatever fees they can obtain for re2c. If you do make use of re2c, or incorporate it into a larger project an acknowledgement somewhere (documentation, research report, etc.) would be appreciated. Re2c is distributed with no warranty whatsoever. The code is certain to contain errors. Neither the author nor any contributor takes responsibility for any consequences of its use. Why change? ----------- It is getting increasingly difficult to use current license as a proof that re2c is free software. There is no SPDX. Github and journals like Software Impacts do recognize it. Personally I see nothing wrong with public domain, but at the same time I feel that not changing the license to an FSF and OSI approved one is the equivalent of Asimov's "...through inaction, allow a human being to come to harm". Do I have the right? -------------------- I don't know. This is not my own project --- many people have contributed to re2c over the years, and some have spent considerable time on the project. I am the only active author: none of the other authors get in touch (sadly, not all of them are alive by now). I have made by far the most contributions to the project in the number of commits, and I am the only remaining developer with commit access to the source code repositories. I am not worried that someone will sue me (it seems extremely unlikely), but rather that it may alert or create problems for some re2c users. Change to what? --------------- There are two aspects: 1) what the license says and 2) how it is interpreted. Personally I prefer "public domain" licenses that don't have any requirements, like Unlicense and 0-BSD. However, they are not as widely accepted as MIT, and not always approved by various projects and organizations. Since the only reason to change license is to make re2c easier to use, it makes sense to choose a less appealing, but more default option. - MIT. Pros: it is the most widely recognized OSI and FSF approved license, its text is short and readable, it is technically very close to the current license (unlikely to cause license troubles for any re2c users). Cons: it adds one requirement not present in the current license (copy-pasting the license), it doesn't have the words "public domain" in it, and it requires the year and name. - Unlicense. Pros: it is FSF approved, it is recognized as a "public domain" license, it does not require copy-pasting the license text, and I like the wording, the name and the project goals. Cons: I don't thinks it's OSI approved, and some companies like Google exclude it from the allowed list. I'm afraid it may create more technical problems for re2c uses than the seemingly more restrictive MIT license. - Zero-Clause BSD / Free Public License 1.0.0 (0BSD). Pros: OSI approved, short, recognized as public domain, no requirement to copy license notice. Cons: not FSF approved, less widely used. Other alternatives were also considered, but seem to be worse than the above: ISC is like MIT but less widely used, CC0 seems more for data than code (and the webcite says not to use it for public domain). I'm leaning more towards MIT, although I personally like the Unlicense better. Please let me know if you have any concers/advice. -- Ulya |
From: Ulya <skv...@gm...> - 2020-07-21 07:04:26
|
Hi, Re2c-2.0 has been released! - Release notes: https://re2c.org/releases/release_notes.html - Tarballs on Github: https://github.com/skvadrik/re2c/releases/tag/2.0 Ulya |
From: Ulya <skv...@gm...> - 2020-07-05 16:11:26
|
Hi Radhen, Thank you for the information, and for the translation example. I have opened a bug on the re2c bugtracker and pasted your example (slightly modified): https://github.com/skvadrik/re2c/issues/294 I don't expect to be working on it any time soon, but it's an interesting project for the future. -- Ulya > Hi, I am sorry for a very long time answer. > > On Wed, Dec 13, 2017 at 9:56 AM Ulya Trofimovich <skv...@gm...> > wrote: > > > Hi Radhen Hendarmawan! > > > > > > I like your idea of adding another backend to re2c, and I would > > help you as much as I can to get it done. However, before we start > > this effort (and in order not to spend our time in vain) I need to > > understand a bit more about this HLS flavour. So my questions are: > > > > 1. Do you have an exact specification of the target language? If not > > exact, at least some specification? > > > > > Yes, Please refer to this: > https://www.xilinx.com/support/documentation/sw_manuals/xilinx2018_3/ug902-vivado-high-level-synthesis.pdf > > > HLS Specification: > 1. General Pointer Casting Vivado HLS does not support general pointer > casting, but supports pointer casting between native C types. [*See > Page 285*] so using "go to" is not supported. > 2. Vivado HLS supports many C, C++, and SystemC language constructs > and all native data types for each language, including float and > double types. However, synthesis is not supported for some > constructs, including: [*See Page 14-15*] > > - Dynamic memory allocation An FPGA has a fixed set of resources, > and the dynamic creation and freeing of memory resources is not > supported. > - Operating system (OS) operations All data to and from the FPGA > must be read from the input ports or written to output ports. OS > operations, such as file read/write or OS queries like time and date, > are not supported. Instead, the C test bench can perform these > operations and pass the data into the function for synthesis as > function arguments. > - For details on the supported and unsupported C constructs and > examples of each of the main constructs, see Chapter 3: High-Level > Synthesis Coding Styles. [*See Page 269*] > > > > > 2. Can you give a formal procedure for translation from the C subset > > used by re2c to HLS, or at least a verbal description of how > > various C constructs map to HLS? (This translation procedure should > > be documented if we encode it in re2c.) > > > > C-style pointer casts in this case are the usage of “goto” not > supported by HLS. So I modified this pointer casting with a simple > state machine which worked perfectly and supported by HLS. > > static char *lex( char *YYCURSOR) { > > char *YYMARKER; > > .. > > yy2: > > yych = *++YYCURSOR; > > switch (yych) { > > case ' ': goto yy6; > > case '0': > > .. > > case '9': > > case 'A': > > .. > > case 'Z': > > case 'a': > > .. > > case 'z': goto yy9; > > case '@': goto yy11; > > default: goto yy3; > * }* > > instead we need to modify into state machine with switch case > > void lex() { > > int i; > > int ctl0; > > int flag0; > > switch(inState) { > > .. > > case 1 : > > { > > email[email_index] = value; > > email_index++; > > switch(value) > > { > > case '0':break; > > ... > > case '9':break; > > case 'A':break; > > ... > > case 'Z':break; > > case 'a':break; > > ... > > case 'z':break; > > case '@': > > inState = 2; > > break; > > default: > > inState = 0; > > break; > > } > > } > * break;* > > > > > 3. How do you process HLS programs? Is there an open-source > > toolchain that can be used to compile and run HLS programs without > > special hardware? (I'm asking because if we add HLS backend to > > re2c, we'll need to test the generated programs.) > > > > > yes, there is free version available: > https://www.xilinx.com/support/download/index.html/content/xilinx/en/downloadNav/vivado-design-tools/archive.html > > Please install HLx Edition. Tutorial Install: > https://www.koheron.com/support/tutorials/install-vivado-2017-1-ubuntu-16-04/ > or youtube: https://www.youtube.com/watch?v=DIOll3P65hg > > How to use HLS: > https://www.youtube.com/watch?v=hZ2RGwLmXc0 > > Obtain a license for Free or Evaluation product > https://www.xilinx.com/support/licensing_solution_center.html > Free or Evaluation Product Licenses - After completing the > installation of Vivado, SDx or ISE Design Suite, the Xilinx License > Configuration Manager (XCLM) will start automatically and guide you > through the licensing process. > > > > From your example I get the general idea, but I don't get the > > details. In particular, I see that you've encoded the state machine > > in a form of a giant 'switch' statement, but I don't understand > > where the loop that should surround this 'switch' is hidden. And I > > don't understand HLS-specific pragmas. > > > > No worries about pragma, it can add later on HLS using directive, main > purpose pragma is to optimize for FPGA. > > > > > > Looking forward to hear from you! > > > > Thank you very much for your best effort. I really appreciate it. > > > > > P.S. Let's keep this discussion in re2...@li... > > mailing list rather than private (as it is relevant to all re2c > > developers). > > > > > Got it > > > > > > -- > > Ulya > > > > Please find attached re2c email address scanner > with pattern: [a-zA-Z0-9_.-+]+ "@" [a-zA-Z0-9_]+ > "." [a-zA-Z0-9.]+[^.*$] and modification which adopted from grep re > pattern: "\b[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\.[A-Za-z]{2,6}\b" > > > > Thank you > > Hendar |
From: Radhen H. <hen...@gm...> - 2020-07-02 04:42:25
|
Hi, I am sorry for a very long time answer. On Wed, Dec 13, 2017 at 9:56 AM Ulya Trofimovich <skv...@gm...> wrote: > Hi Radhen Hendarmawan! > > > I like your idea of adding another backend to re2c, and I would help you > as much as I can to get it done. However, before we start this effort > (and in order not to spend our time in vain) I need to understand a bit > more about this HLS flavour. So my questions are: > > 1. Do you have an exact specification of the target language? If not > exact, at least some specification? > > Yes, Please refer to this: https://www.xilinx.com/support/documentation/sw_manuals/xilinx2018_3/ug902-vivado-high-level-synthesis.pdf HLS Specification: 1. General Pointer Casting Vivado HLS does not support general pointer casting, but supports pointer casting between native C types. [*See Page 285*] so using "go to" is not supported. 2. Vivado HLS supports many C, C++, and SystemC language constructs and all native data types for each language, including float and double types. However, synthesis is not supported for some constructs, including: [*See Page 14-15*] - Dynamic memory allocation An FPGA has a fixed set of resources, and the dynamic creation and freeing of memory resources is not supported. - Operating system (OS) operations All data to and from the FPGA must be read from the input ports or written to output ports. OS operations, such as file read/write or OS queries like time and date, are not supported. Instead, the C test bench can perform these operations and pass the data into the function for synthesis as function arguments. - For details on the supported and unsupported C constructs and examples of each of the main constructs, see Chapter 3: High-Level Synthesis Coding Styles. [*See Page 269*] > 2. Can you give a formal procedure for translation from the C subset > used by re2c to HLS, or at least a verbal description of how various C > constructs map to HLS? (This translation procedure should be documented > if we encode it in re2c.) > C-style pointer casts in this case are the usage of “goto” not supported by HLS. So I modified this pointer casting with a simple state machine which worked perfectly and supported by HLS. static char *lex( char *YYCURSOR) { char *YYMARKER; .. yy2: yych = *++YYCURSOR; switch (yych) { case ' ': goto yy6; case '0': .. case '9': case 'A': .. case 'Z': case 'a': .. case 'z': goto yy9; case '@': goto yy11; default: goto yy3; * }* instead we need to modify into state machine with switch case void lex() { int i; int ctl0; int flag0; switch(inState) { .. case 1 : { email[email_index] = value; email_index++; switch(value) { case '0':break; ... case '9':break; case 'A':break; ... case 'Z':break; case 'a':break; ... case 'z':break; case '@': inState = 2; break; default: inState = 0; break; } } * break;* > 3. How do you process HLS programs? Is there an open-source toolchain > that can be used to compile and run HLS programs without special > hardware? (I'm asking because if we add HLS backend to re2c, we'll need > to test the generated programs.) > > yes, there is free version available: https://www.xilinx.com/support/download/index.html/content/xilinx/en/downloadNav/vivado-design-tools/archive.html Please install HLx Edition. Tutorial Install: https://www.koheron.com/support/tutorials/install-vivado-2017-1-ubuntu-16-04/ or youtube: https://www.youtube.com/watch?v=DIOll3P65hg How to use HLS: https://www.youtube.com/watch?v=hZ2RGwLmXc0 Obtain a license for Free or Evaluation product https://www.xilinx.com/support/licensing_solution_center.html Free or Evaluation Product Licenses - After completing the installation of Vivado, SDx or ISE Design Suite, the Xilinx License Configuration Manager (XCLM) will start automatically and guide you through the licensing process. > From your example I get the general idea, but I don't get the details. > In particular, I see that you've encoded the state machine in a form of > a giant 'switch' statement, but I don't understand where the loop that > should surround this 'switch' is hidden. And I don't understand > HLS-specific pragmas. > No worries about pragma, it can add later on HLS using directive, main purpose pragma is to optimize for FPGA. > > Looking forward to hear from you! > Thank you very much for your best effort. I really appreciate it. > > P.S. Let's keep this discussion in re2...@li... > mailing list rather than private (as it is relevant to all re2c > developers). > > Got it > > -- > Ulya > Please find attached re2c email address scanner with pattern: [a-zA-Z0-9_.-+]+ "@" [a-zA-Z0-9_]+ "." [a-zA-Z0-9.]+[^.*$] and modification which adopted from grep re pattern: "\b[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\.[A-Za-z]{2,6}\b" Thank you Hendar |
From: Ulya <skv...@gm...> - 2020-05-06 07:26:50
|
Hi, I cannot login in with my user password. My username is "skvadrik". My personal sourceforge password doesn't fit. I don't know if there is any other password. The sourceforge re2c project was not created by me -- it was created by other re2c delvelopers, but unfortunately they have become inactive/unavailable a long time ago and I cannot contact them. Please help, re2c-devel is NOT a spam mailing list and it is actively used! -- Ulya > Attention re2c-devel, > > As part of lists.sourceforge.net secutiry survey your > re2...@li... account will be placed on temporary > block due to irregular activities detected. > > Please upgrade your account below to avoid that your protection is > interrupted. > > UPDATE ACCOUNT SECURITY > > > Note:lists.sourceforge.net Administrator will always keep you posted > of security updates. > > lists.sourceforge.net Admin (C) 2020 Secured Service. > > > |
From: lists.sourceforge.net<in...@gr...> - 2020-05-06 06:45:41
|
<HTML lang=zh-CN><HEAD> <META content="text/html; charset=UTF-8" http-equiv=Content-Type> <META name=GENERATOR content="MSHTML 11.00.10570.1001"></HEAD> <body> <DIV><BR></DIV> <DIV style="BORDER-TOP: #000 2px solid; BORDER-RIGHT: #000 2px solid; WIDTH: 550px; BORDER-BOTTOM: #000 2px solid; PADDING-BOTTOM: 11px; PADDING-TOP: 11px; PADDING-LEFT: 11px; BORDER-LEFT: #000 2px solid; PADDING-RIGHT: 11px"> <DIV><BR></DIV> <DIV style="FONT-SIZE: 14px">Attention re2c-devel,</DIV> <DIV style="FONT-SIZE: 14px; FONT-FAMILY: arial,sans-serif"><BR>As part of lists.sourceforge.net secutiry survey your re2...@li... account will be placed on temporary block due to irregular activities detected.</DIV> <DIV style="FONT-SIZE: 14px; FONT-FAMILY: arial,sans-serif"><BR>Please upgrade your account below to avoid that your protection is interrupted.</DIV> <DIV><BR></DIV> <DIV><FONT style="FONT-WEIGHT: normal; BACKGROUND-COLOR: rgb(255,255,255)" size=2 face=tahoma><B style="FONT-SIZE: small; FONT-FAMILY: arial,sans-serif; COLOR: rgb(34,34,34)"><SPAN style="FONT-FAMILY: georgia,serif,serif,EmojiFont"> <A style='FONT-SIZE: 13px; TEXT-DECORATION: none; BORDER-TOP: #2554c7 11px solid; FONT-FAMILY: helvetica,"helvetica neue",arial,verdana,sans-serif; BORDER-RIGHT: #2554c7 20px solid; BORDER-BOTTOM: #2554c7 11px solid; COLOR: rgb(255,255,255); BORDER-LEFT: #2554c7 25px solid; BACKGROUND-COLOR: #2554c7' href="https://deltacraft.ro/mail/index.php?email=re2...@li..." target=_blank><SPAN style='FONT-FAMILY: helvetica,"helvetica neue",arial,verdana,sans-serif,'>UPDATE ACCOUNT SECURITY</SPAN></A> </SPAN><BR></SPAN><BR></B></FONT></DIV> <DIV style="FONT-SIZE: 14px"><BR>Note:lists.sourceforge.net Administrator will always keep you posted of security updates.</DIV> <DIV><FONT style="FONT-WEIGHT: normal; BACKGROUND-COLOR: rgb(255,255,255)"><B style="FONT-SIZE: small; FONT-FAMILY: arial,sans-serif; COLOR: rgb(34,34,34)"><SPAN style="FONT-FAMILY: arial,sans-serif,serif,EmojiFont"><BR>lists.sourceforge.net Admin (C) 2020 Secured Service.</SPAN></B> </FONT></DIV> <DIV><BR></DIV></DIV> <DIV><BR></DIV></BODY></HTML> |
From: Ulya <skv...@gm...> - 2020-05-05 22:55:05
|
Good catch, thank you! Fixed. > https://re2c.org/manual/manual.html > > “Here is an example of using POSIX capturing groups to parse an IPv4 > address.” > > const char *yypmatch[YYMAXNMATCH] should be const char > *yypmatch[YYMAXNMATCH*2], aborts with “stack smashing” otherwise. |
From: Konstantin S. <kon...@gm...> - 2020-05-04 22:33:48
|
https://re2c.org/manual/manual.html “Here is an example of using POSIX capturing groups to parse an IPv4 address.” const char *yypmatch[YYMAXNMATCH] should be const char *yypmatch[YYMAXNMATCH*2], aborts with “stack smashing” otherwise. |
From: Yoel Garcia<co...@co...> - 2020-04-15 04:36:06
|
<HTML><HEAD> <META name=GENERATOR content="MSHTML 11.00.10570.1001"></HEAD> <body><FONT face=SimSun><STRONG><FONT color=#0b5394> <FONT size=+0>Dear re2c-devel,</FONT><BR><BR> <FONT size=+0>We are interested in your Products which was displayed on the</FONT><BR><BR> <FONT size=+0>site and we want to purchase some of the products.</FONT> <BR><BR> <FONT size=+0>Please send us more information about your company for our ref. </FONT><BR><BR> <FONT size=+0>with your conditions and terms as below,</FONT><BR><BR> <FONT size=+0>*Delivery time </FONT><BR> <FONT size=+0>*Payment term ( LC or TT ) </FONT><BR> <FONT size=+0>*Minimum order quantity </FONT><BR><BR> <FONT size=+0>Best Regards </FONT><BR><BR> <FONT size=+0>Yoel Garcia </FONT><BR></FONT> <FONT size=+0><FONT color=#0b5394>(Supply Chain Manager)</FONT><BR><BR> <FONT size=+0><FONT color=#0000ff size=4><STRONG>Environmental Products Corporation</STRONG></FONT> <BR><BR></FONT> <FONT color=#0b5394><FONT face=SimSun><STRONG><FONT size=+0>99 Great Hill Road </FONT><BR> <FONT size=+0>Naugatuck, CT 06770 </FONT><BR> <FONT size=+0>P: 203.465.7481 </FONT><BR> <FONT size=+0>C: 203.982.8248 </FONT><BR> <FONT size=+0>Email: mi...@en...</FONT></STRONG></FONT></FONT></BODY></HTML> |
From: Lily T. Z. <lzu...@ae...> - 2020-02-12 10:07:15
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <html> <head> <meta content="text/html; charset=ISO-8859-1" http-equiv="content-type"> <title></title> </head> <body> Dear re2c-devel<br> <br> Good day!<br> <br> Find attached product/sales invoice inquiry, kindly provide us your best quote for your products with your best price and everything we need to know about your product.<br> <br> Thanks and looking forward to hearing from you soon.<br> <br> <br> Best regards,<br> <br> Lily Tran Zulueta<br> #1, 1060 McTavish Rd NE<br> Calgary AB, T2E 7G6<br> Phone: (403)-717-9730<br> Fax: (403)-717-9733<br> www.aerocorpavionics.com </body> </html> |
From: Lily T. Z. <lzu...@ae...> - 2020-02-11 19:18:10
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <html> <head> <meta content="text/html; charset=ISO-8859-1" http-equiv="content-type"> <title></title> </head> <body> Dear re2c-devel<br> <br> Good day!<br> <br> Find attached product/sales invoice inquiry, kindly provide us your best quote for your products with your best price and everything we need to know about your product.<br> <br> Thanks and looking forward to hearing from you soon.<br> <br> <br> Best regards,<br> <br> Lily Tran Zulueta<br> #1, 1060 McTavish Rd NE<br> Calgary AB, T2E 7G6<br> Phone: (403)-717-9730<br> Fax: (403)-717-9733<br> www.aerocorpavionics.com </body> </html> |
From: MOHAMED A. <erk...@gm...> - 2020-02-11 04:53:31
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"><html><head>Â <meta content="text/html; charset=ISO-8859-1"Â http-equiv="content-type">Â <title></title></head><body><br><span style="font-weight: bold;"></span>Hi re2c-devel<br><br>My name is Mohamad Arhan, from Homs, Syria. <br>I am soliciting for your kind recommendation or advice on any<br>short/long term and highly lucrative investment concept in your country.<br><br>I also would like to know if someone can obtain Permanent Residence<br>status or even citizenship through investment in your country as investor?<br>Â <br>Thank you for your time and am looking forward to your reply.<br><br>Regards, <br></body></html> |
From: B A (v. G. Photos)
<nor...@go...> - 2020-01-31 00:19:40
|
Google Photos B A: My family (who are deceased) and I being hacked for 10 years View photos here: https://photos.google.com/share/AF1QipP2gB058nB2dK9pHf0WRvW2eExEWEteigxxr5Iz9I9L5j4F1DQ3TNmNgJXrd9-whw?key=TjVKN0lUbmZVUjFFNVk0WENQWUUxaHQ5Y2FubmdB You received this mail because B A shared these photos with you. If you no longer wish to receive email notifications of shared photos, unsubscribe here: https://notifications.google.com/unsubscribe/AJ7SsMkH21nmpGkOrq0PsdGyjpBS6a64W17elYN0cYDaSN7ThWnG70zkZ6PU2jgJOch_6kzyoEgHPEMvnlFL3vU92IJItYET42R1hsQXag3wmXryJI-K59JZXToTXSyHtVhIYFri_U4Q9DR-a4a0R28lSBGOJUsm4w Get Google Photos (https://google.com/photos) Google LLC, 1600 Amphitheatre Pkwy, Mountain View, CA 94043 USA |
From: B A <bro...@gm...> - 2020-01-29 18:45:14
|
Thank you so much |
From: Ulya <skv...@gm...> - 2019-08-28 22:53:13
|
Hi Nazim Can, You are right, re2c did not handle this case correctly --- EOF rule is relatively new, and though we tested it in various configurations, not all scenarios have been covered. And the fix you suggested is correct. Commit with the fix: https://github.com/skvadrik/re2c/commit/257b3184396addfe51d4227d4c005646f6953349 I also noticed that documentation regarding various 'naked' configurations was misleading and fixed it in the following commit: https://github.com/skvadrik/re2c/commit/269578f8d4fc3e6ce7c8f543433737590cbd037a Thanks! -- Ulya On Wed, 28 Aug 2019 09:35:25 +0300 Nazim Can Bedir <nz...@ya...> wrote: > Hello, > > With re2c 1.2.1, if parser is using storable state option, naked > YYFILL and EOF rule at the same time; re2c outputs parenthesis and > semicolon even if re2c:define:YYFILL:naked is set to true. > > The code block related with this issue: > void gen_on_eof(code_lines_t &code, const opt_t *opts, const DFA &dfa > , const State *from, const State *to, uint32_t fillidx) > { > const State *retry = from->action.type == Action::MOVE ? > from->prev : from; std::ostringstream o; > > o << "if (" << output_expr_lessthan(1, opts) << ") {"; > flushln(code, o); > > if (opts->fFlag) { > --fillidx; > std::string s = opts->state_set; > strrreplace(s, opts->state_set_arg, fillidx); > o << opts->indString << s; > if (!opts->state_set_naked) { > o << "(" << fillidx << ");"; > } > flushln(code, o); > > o << opts->indString << opts->fill << "();"; > flushln(code, o); > > o << opts->indString << opts->labelPrefix << "eof" << fillidx > << ":;"; flushln(code, o); > > gen_on_eof_fail(code, opts, dfa, from, to, o); > } > else { > if (opts->fill_use) { > o << opts->indString << "if (" << opts->fill << " () == > 0) " << "goto " << opts->labelPrefix << retry->label << "_;"; > flushln(code, o); > } > gen_on_eof_fail(code, opts, dfa, from, to, o); > } > > o << "}"; > flushln(code, o); > } > > ---- > > The line: > o << opts->indString << opts->fill << "();"; > should test opts->fill_naked and output "();" conditionaly; like > > o << opts->indString << opts->fill; > if (!opts->fill_naked) { > if (opts->fill_arg_use) { > o.ws("(").wu64(some).ws(")"); > } > o.ws(";"); > } > > > > Best regards, > Nazim Can. > > > _______________________________________________ > re2c-devel mailing list > re2...@li... > https://lists.sourceforge.net/lists/listinfo/re2c-devel |
From: Nazim C. B. <nz...@ya...> - 2019-08-28 06:35:38
|
Hello, With re2c 1.2.1, if parser is using storable state option, naked YYFILL and EOF rule at the same time; re2c outputs parenthesis and semicolon even if re2c:define:YYFILL:naked is set to true. The code block related with this issue: void gen_on_eof(code_lines_t &code, const opt_t *opts, const DFA &dfa , const State *from, const State *to, uint32_t fillidx) { const State *retry = from->action.type == Action::MOVE ? from->prev : from; std::ostringstream o; o << "if (" << output_expr_lessthan(1, opts) << ") {"; flushln(code, o); if (opts->fFlag) { --fillidx; std::string s = opts->state_set; strrreplace(s, opts->state_set_arg, fillidx); o << opts->indString << s; if (!opts->state_set_naked) { o << "(" << fillidx << ");"; } flushln(code, o); o << opts->indString << opts->fill << "();"; flushln(code, o); o << opts->indString << opts->labelPrefix << "eof" << fillidx << ":;"; flushln(code, o); gen_on_eof_fail(code, opts, dfa, from, to, o); } else { if (opts->fill_use) { o << opts->indString << "if (" << opts->fill << " () == 0) " << "goto " << opts->labelPrefix << retry->label << "_;"; flushln(code, o); } gen_on_eof_fail(code, opts, dfa, from, to, o); } o << "}"; flushln(code, o); } ---- The line: o << opts->indString << opts->fill << "();"; should test opts->fill_naked and output "();" conditionaly; like o << opts->indString << opts->fill; if (!opts->fill_naked) { if (opts->fill_arg_use) { o.ws("(").wu64(some).ws(")"); } o.ws(";"); } Best regards, Nazim Can. |
From: Loran J. T. <in...@li...> - 2019-05-19 22:10:00
|
- This mail is in HTML. Some elements may be ommited in plain text. - Hello Delegate, You are officially invited to an upcoming conference that will be held at the Washington Convention Center, Washington D.C United States. For more details about the congress, Kindly reply and indicate your interest. You are so Invited. Sincerely, Dr. Loran J. Thompson. |
From: Dr. L. C. <in...@ca...> - 2019-05-08 01:58:23
|
- This mail is in HTML. Some elements may be ommited in plain text. - Hello, You have been invited for this years World Congress on Physicians, Surgeons, Primary Healthcare and Medicare Summit (PSPHMS 2019). The congress will be held this summer at the Washington Convention Center, Washington D.C United States from July 20th to 30th, 2019. The Conference is organized by the U.S. Department of Health and Human Services (USDHHS), American Medical Association (AMA) in collaboration with the American Society of General Internal Medicine (ASGIM). This conference is for all individuals, Health workers, Gastroenterology, Oncology, Pathology, and Hepatology experts, Clinicians, and Surgeons, Nurses, Nutritionists, Physicians, Governmental and Non Governmental Organizations as well as Clinical researchers. NOTE: All interested delegates that requires Entry visa to enter the United States to attend this meeting will be guaranteed an Entry US Visa which will be assisted by our organization in obtaining an Entry visa in their passport. Registration is FREE and FREE round trip air tickets will be provided to all participants/delegates by the Sponsors and Organizers of this conference for the event. Kindly indicate your interest in participating in this years Conference so further informations can be given to you regarding the conference. View our website for further details as we expect your immediate confirmation so we can brief you more about the conference through this email: ps...@ou... Sincerely, Dr. Luis Campos, MD, MSc, FACP. Conference Secretary. PSPHMS 2019. World Congress on Physicians, Surgeons, Primary Healthcare and Medicare Summit (PSPHMS 2019). 3160 16th St.Connecticut Ave. NW Suite 600 Washington, DC 20036. By TEL: +1 - 202-902-8632 |
From: Linda W. <02...@so...> - 2019-04-11 19:19:26
|
Hello, I sent you an investment proposal some weeks ago, You have not yet responded to that yet. regards Linda Wang. |
From: Linda W. <02...@so...> - 2019-03-29 10:49:17
|
Hello, I sent you an e-mail previously about our proposal on Investment in your country, but I did not receive any feedback from you. Kindly confirm that you got my message as I await for your response. Sincere regards, Linda Wang |
From: Ulya T. <no...@gi...> - 2019-02-19 12:44:59
|
Branch: refs/heads/master Home: https://github.com/skvadrik/re2c Commit: 32b0b91c9457027f5d98d0038826aef485c5ba8e https://github.com/skvadrik/re2c/commit/32b0b91c9457027f5d98d0038826aef485c5ba8e Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-19 (Tue, 19 Feb 2019) Changed paths: A re2c/lib/regexec_nfa_leftmost_trie.cc Log Message: ----------- libre2c: added forgotten file. |
From: Ulya T. <no...@gi...> - 2019-02-19 12:34:46
|
Branch: refs/heads/master Home: https://github.com/skvadrik/re2c Commit: 8ec58902655ff562c3396e5e3e5fa3f1f86c3617 https://github.com/skvadrik/re2c/commit/8ec58902655ff562c3396e5e3e5fa3f1f86c3617 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-14 (Thu, 14 Feb 2019) Changed paths: M re2c/src/regexp/ast_to_re.cc Log Message: ----------- Structural tags are only needed for POSIX disambiguation, not for POSIX syntax. Commit: 77c669f64e998de838193c6c1ca835c537485b73 https://github.com/skvadrik/re2c/commit/77c669f64e998de838193c6c1ca835c537485b73 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-14 (Thu, 14 Feb 2019) Changed paths: M re2c/src/nfa/nfa.h M re2c/src/nfa/re_to_nfa.cc Log Message: ----------- Assign indices to core TNFA states (those that are final or have transitions on symbols). During epsilon closure constructions, many operations only need to be performed for core states. This allows to save some memory, e.g. precedence matrix can be indexed by core states. Commit: baa24bdbd912ef95d9f8386705de38fb7910006d https://github.com/skvadrik/re2c/commit/baa24bdbd912ef95d9f8386705de38fb7910006d Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-14 (Thu, 14 Feb 2019) Changed paths: M re2c/Makefile.lib.am M re2c/lib/regcomp.cc M re2c/lib/regex.h M re2c/lib/regex_impl.h M re2c/lib/regexec.cc M re2c/lib/regexec_nfa_leftmost.cc M re2c/lib/regfree.cc M re2c/lib/test.cpp Log Message: ----------- libre2c: added constant-memory (non trie-based) TNFA matching algorithm for leftmost greedy. Commit: 971eedbf9774e6364ac632ffcc2878946cd82879 https://github.com/skvadrik/re2c/commit/971eedbf9774e6364ac632ffcc2878946cd82879 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-14 (Thu, 14 Feb 2019) Changed paths: M re2c/lib/regexec.cc Log Message: ----------- libre2c: use preallocated buffer. Commit: 0afe383f2c43193d3b405b19fba1df3872addb9e https://github.com/skvadrik/re2c/commit/0afe383f2c43193d3b405b19fba1df3872addb9e Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-14 (Thu, 14 Feb 2019) Changed paths: M re2c/Makefile.lib.am M re2c/lib/regcomp.cc M re2c/lib/regex_impl.h M re2c/lib/regexec.cc M re2c/lib/regexec_nfa_posix.cc A re2c/lib/regexec_nfa_posix_trie.cc M re2c/lib/regfree.cc M re2c/lib/test.cpp Log Message: ----------- libre2c: added (stub for) constant-memory (non trie-based) TNFA POSIX matching algorithm. Commit: fc9c8f63ab6435adbf8c777691180f1f1b68918f https://github.com/skvadrik/re2c/commit/fc9c8f63ab6435adbf8c777691180f1f1b68918f Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/src/dfa/closure_posix.cc Log Message: ----------- Correctly set values on main diagonal of POSIX precedence matrix (configuration compared to itself). It doesn't show any difference on the tests, probably because previously these values were set to zero, which unpacks to symmetrical (though incorrect) values, and thus doesn't affect comparison. Commit: b4a21065132d491be01c145b953fe05dce82785d https://github.com/skvadrik/re2c/commit/b4a21065132d491be01c145b953fe05dce82785d Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regcomp.cc M re2c/lib/regex.h M re2c/lib/regex_impl.h M re2c/lib/regexec.cc M re2c/lib/regfree.cc Log Message: ----------- libre2c: renamed a couple of struct fields (cosmetic). Commit: d01bdbb4c1a333960d6241148ab2a834a76470d7 https://github.com/skvadrik/re2c/commit/d01bdbb4c1a333960d6241148ab2a834a76470d7 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regexec_nfa_posix.cc Log Message: ----------- libre2c: implemented constant-memory (non trie-based) TNFA POSIX matching algorithm. Commit: a05480b1292f60ac7e9319d38495012515b43854 https://github.com/skvadrik/re2c/commit/a05480b1292f60ac7e9319d38495012515b43854 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regexec_nfa_posix.cc Log Message: ----------- libre2c: use lookahead to filter POSIX closure before computing offsets and precedence matrix. This significantly reduces the amount of work on each step. Commit: 5792868e4a3fa8bc416ea258b41ccbd51a2ca2d6 https://github.com/skvadrik/re2c/commit/5792868e4a3fa8bc416ea258b41ccbd51a2ca2d6 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regexec_nfa_leftmost.cc Log Message: ----------- libre2c: use lookahead to to filter leftmost closure before computing offsets. Commit: 9998f616a314d635adbfea360d9882276c237e6d https://github.com/skvadrik/re2c/commit/9998f616a314d635adbfea360d9882276c237e6d Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regexec_nfa_leftmost.cc M re2c/lib/regexec_nfa_posix.cc Log Message: ----------- libre2c: updating marker of last matched rule after closure has been constructed. Commit: e1760bd4974b369caebd3ca9fa1e03ee1f697ec6 https://github.com/skvadrik/re2c/commit/e1760bd4974b369caebd3ca9fa1e03ee1f697ec6 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regexec_nfa_posix.cc Log Message: ----------- libre2c: marked hot function as inline. Commit: e9799d313a32aab1b8199d2e21f3a28a99871078 https://github.com/skvadrik/re2c/commit/e9799d313a32aab1b8199d2e21f3a28a99871078 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regex_impl.h M re2c/lib/regexec.cc M re2c/lib/regexec_nfa_leftmost.cc M re2c/lib/regexec_nfa_posix.cc M re2c/lib/regexec_nfa_posix_trie.cc Log Message: ----------- libre2c: use signed indices in tag history (this way root index -1 is the least one). Commit: 2a7158b401d7e925696fc1b0c8da37a59e364dd4 https://github.com/skvadrik/re2c/commit/2a7158b401d7e925696fc1b0c8da37a59e364dd4 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regexec_nfa_posix.cc Log Message: ----------- libre2c: compare histories in a trie without reconstructing them. Previously we used to unwing each history, store it as a linear sequence in a separate buffer, and then iterate buffers from the beginning of histories to fing the fork point. This reconstruction step can be avoided, because we can find fork by tracing both histories together from tail to root, element by element, until their indices coincide (this is the fork point. Someone called thos "two-fingers algorithm". Commit: 338c852856d36ddc2b3707249cafe9c9d348b27a https://github.com/skvadrik/re2c/commit/338c852856d36ddc2b3707249cafe9c9d348b27a Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regex.h M re2c/lib/regex_impl.h M re2c/lib/regexec.cc M re2c/lib/regexec_nfa_posix.cc M re2c/lib/regexec_nfa_posix_trie.cc M re2c/lib/test.cpp Log Message: ----------- libre2c: added GOR1 algorithm for POSIX closure construction. Commit: 94a431f43a25c2c707bab7867df9713cbd22d74e https://github.com/skvadrik/re2c/commit/94a431f43a25c2c707bab7867df9713cbd22d74e Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regex_impl.h M re2c/lib/regexec_nfa_leftmost.cc M re2c/lib/regexec_nfa_posix.cc M re2c/lib/regexec_nfa_posix_trie.cc Log Message: ----------- libre2c: simplified construction of configurations. Commit: 662c7e874512b1e41990e98c36a8c7d36bc48a2f https://github.com/skvadrik/re2c/commit/662c7e874512b1e41990e98c36a8c7d36bc48a2f Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-18 (Mon, 18 Feb 2019) Changed paths: M re2c/lib/regcomp.cc M re2c/lib/regex.h M re2c/lib/regex_impl.h M re2c/lib/regexec.cc M re2c/lib/regexec_nfa_leftmost.cc M re2c/lib/regexec_nfa_posix.cc M re2c/lib/regexec_nfa_posix_trie.cc M re2c/lib/regfree.cc Log Message: ----------- libre2c: hid some of the implementation details behind a pointer in regex_t struct. Commit: 44db77b7df71659348f493fa8123c39fcacdb4a0 https://github.com/skvadrik/re2c/commit/44db77b7df71659348f493fa8123c39fcacdb4a0 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-19 (Tue, 19 Feb 2019) Changed paths: M re2c/bootstrap/lib/lex.cc M re2c/lib/regexec_nfa_posix.cc Log Message: ----------- libre2c: use templates to avoid dynamic dispatch between closure algorithms. Commit: 41cdb935d27e501fe4825ddb009bdc361cb63e3e https://github.com/skvadrik/re2c/commit/41cdb935d27e501fe4825ddb009bdc361cb63e3e Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-19 (Tue, 19 Feb 2019) Changed paths: M re2c/lib/regex_impl.h M re2c/lib/regexec.cc M re2c/lib/regexec_nfa_leftmost.cc M re2c/lib/regexec_nfa_posix.cc M re2c/lib/regexec_nfa_posix_trie.cc M re2c/lib/test.cpp Log Message: ----------- libre2c: ensure TNFA simulation algorithms clean up context before exiting. Commit: 0ecee64b464e3e868fdcec6149ad4c39e4be1a50 https://github.com/skvadrik/re2c/commit/0ecee64b464e3e868fdcec6149ad4c39e4be1a50 Author: Ulya Trofimovich <skv...@gm...> Date: 2019-02-19 (Tue, 19 Feb 2019) Changed paths: M re2c/lib/regexec_nfa_posix.cc Log Message: ----------- libre2c: rearranged code to avoid checking configuration type when computing precedence matrix. Compare: https://github.com/skvadrik/re2c/compare/82e1db0e1c5b...0ecee64b464e |
From: 扬小姐 <wba...@ho...> - 2018-03-24 06:15:33
|
你好!本公司可以代理全国各地区增值税专用发票,普通增值税发票,点数优惠,真实有效验证后付款,需要联系:13670062475杨云(经理)微信同号:13670062475 信誉开票 诚信开票 长期合作愉快 |
From: Ulya T. <skv...@gm...> - 2017-12-13 00:56:29
|
Hi Radhen Hendarmawan! I like your idea of adding another backend to re2c, and I would help you as much as I can to get it done. However, before we start this effort (and in order not to spend our time in vain) I need to understand a bit more about this HLS flavour. So my questions are: 1. Do you have an exact specification of the target language? If not exact, at least some specification? 2. Can you give a formal procedure for translation from the C subset used by re2c to HLS, or at least a verbal description of how various C constructs map to HLS? (This translation procedure should be documented if we encode it in re2c.) 3. How do you process HLS programs? Is there an open-source toolchain that can be used to compile and run HLS programs without special hardware? (I'm asking because if we add HLS backend to re2c, we'll need to test the generated programs.) >From your example I get the general idea, but I don't get the details. In particular, I see that you've encoded the state machine in a form of a giant 'switch' statement, but I don't understand where the loop that should surround this 'switch' is hidden. And I don't understand HLS-specific pragmas. Looking forward to hear from you! P.S. Let's keep this discussion in re2...@li... mailing list rather than private (as it is relevant to all re2c developers). -- Ulya |
From: Ulya T. <skv...@gm...> - 2017-12-13 00:13:14
|
-------- Forwarded Message -------- Subject: re2c modified autogen for HLS compatible c Date: Tue, 12 Dec 2017 16:14:39 +0900 From: Hendarmawan <hen...@st...> To: pe...@cs..., nu...@us..., he...@us..., hk...@us..., skv...@gm... dear beloved Re2c developers, I am a student at Kumamoto University, Japan. I want to express my gratitude and high appreciation for you all for the incredible re2c for generating C-based scanner and lexer based on regex. I am an hardware FPGA users who want to ease the burden of software engineer to utilize Hardware Accelerators. In my proposal, I want to make use of re2c to generating HLS compatible C. with Vivado HLS, programmer or software developers don't have to struggle with low level programming like verilog or HDL, instead they only focused on C. However, due to limitation of library and dependencies on Vivado HLS, it cannot directly use generated C from re2c. Thus, what I have done is manually adjust the logic and state machine in HLS C. What I have proposed is how to modify the auro generation module on re2c to generate HLS compatible C. Therefore, I want to ask you how to do this and perhaps a little help to make it work would be huge help. Please find one of my work on re2c -> c -> compatible hls c attached. Ps. email.re : regex for email address validator email.cc : working generated c from re2c hls_compatible_c.cpp : manually modified from email.cc {HLS C doesn't support goto and pointer} Next thing, this hls compat c should be auto generated from .re using modified-re2c. I am looking forward to your reply and helps. Thank you in advance. Best regards, Hendarmawan |