Are you over 18 and want to see adult content?
2
More Annotations
![A complete backup of burberryscarf.us](https://www.archivebay.com/archive5/images/73187435-24b5-4f3b-a839-630659c5d12d.png)
A complete backup of burberryscarf.us
burberryscarf.us
Are you over 18 and want to see adult content?
6
![A complete backup of thehollywoodchristmasparade.org](https://www.archivebay.com/archive5/images/0a32a0a9-3566-4013-b6e6-d9128ef471ae.png)
A complete backup of thehollywoodchristmasparade.org
thehollywoodchristmasparade.org
Are you over 18 and want to see adult content?
![A complete backup of sense-design.com](https://www.archivebay.com/archive5/images/d2934c6d-9d38-4c28-aaab-a32e89ef10dc.png)
A complete backup of sense-design.com
sense-design.com
Are you over 18 and want to see adult content?
5
Favourite Annotations
![A complete backup of tattoosbeautiful.com](https://www.archivebay.com/archive5/images/be75d79a-5704-4c9b-9152-eb4df93bdbd7.png)
A complete backup of tattoosbeautiful.com
tattoosbeautiful.com
Are you over 18 and want to see adult content?
3
![A complete backup of garnetandblackattack.com](https://www.archivebay.com/archive5/images/626bb75a-eb5f-43ee-a5f2-042b2050450a.png)
A complete backup of garnetandblackattack.com
garnetandblackattack.com
Are you over 18 and want to see adult content?
3
Text
LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,
OS X, and Solaris
BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity.RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawtermRESEARCH!RSC
Modifying the OS X kernel binary to make user-level CPU profiling work ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several A CONCURRENT WINDOW SYSTEM A Concurrent Window System Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT When implemented in a concurrent language, a window system can be concise. RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity.RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawtermRESEARCH!RSC
Modifying the OS X kernel binary to make user-level CPU profiling work ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several A CONCURRENT WINDOW SYSTEM A Concurrent Window System Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT When implemented in a concurrent language, a window system can be concise. RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
IMPLEMENTING REGULAR EXPRESSIONS An introduction to using finite automata to implement regular expression matching, and why the standard backtracking implementationis a bad idea.
REGULAR EXPRESSION MATCHING CAN BE SIMPLE AND FAST Notice that the graph's y-axis has a logarithmic scale, in order to be able to see a wide variety of times on a single graph.. From the graph it is clear that Perl, PCRE, Python, and Ruby are all using recursive backtracking. PCRE stops getting the right answer at n=23, because it aborts the recursive backtracking after a maximum number of steps.As of Perl 5.6, Perl's regular expression engine PATTERNS AND HINTS FOR CONCURRENCY IN GO Patterns and Hints for Concurrency in Go Russ Cox MIT 6.824 / Spring2021
IBM 7094 CHEAT SHEET IBM 7094 Cheat Sheet Russ Cox rsc@swtch.com November 2000; updated January 2007 (sic) The IBM 7094 was a 1960s-era mainframe. Tony Van Vleck has documented its use in the CTSS system. Ken Thompson was working on an IBM 7094 running CTSS when he REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
THE TEXT EDITOR SAM
› 3 › The Command Language A file consists of its contents, which are an array of characters (that is, a string); the name of the associated disc file; the modified bit that states whether the contents match those of the disc file; and a substring of the contents, called the current text or dot (see Figures 1 and 2). RESEARCH!RSC: QART CODES QR codes are 2-dimensional bar codes that encode arbitrary text strings. A common use of QR codes is to encode URLs so that people can scan a QR code (for example, on an advertising poster, building roof, volleyball bikini, belt buckle, or airplane banner) to load a web site on a cell phone instead of having to “type” in a URL. QR codes are encoded using Reed-Solomon error-correcting codes A CONCURRENT WINDOW SYSTEM - 3 - client: prog(W, K, M) (The syntax used in this paper is based on Newsqueak, but should be mostly self-explanatory.) Once it has been invoked, the client can be represented pictorially, using arrows to represent the flow of information. RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
SWTCHBOARD
Created Date: 191020203151302 LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
IMPLEMENTING REGULAR EXPRESSIONS Ville Laurikari, “NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions,” in Proceedings of the Symposium on String Processing and Information Retrieval, September 2000.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawtermRESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013. ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
IMPLEMENTING REGULAR EXPRESSIONS 2 History Finite automata first introduced by McCullock and Pitts (1943) to model neurons. ‘‘A logical calculus of ideas immanent in nervous activity,’’ Bull. Math. Biophys. 5, pp. 115-133. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has severalSWTCHBOARD
Created Date: 191020203151302 LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
IMPLEMENTING REGULAR EXPRESSIONS Ville Laurikari, “NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions,” in Proceedings of the Symposium on String Processing and Information Retrieval, September 2000.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawtermRESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013. ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
IMPLEMENTING REGULAR EXPRESSIONS 2 History Finite automata first introduced by McCullock and Pitts (1943) to model neurons. ‘‘A logical calculus of ideas immanent in nervous activity,’’ Bull. Math. Biophys. 5, pp. 115-133. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has severalSWTCHBOARD
Created Date: 191020203151302 IMPLEMENTING REGULAR EXPRESSIONS Ville Laurikari, “NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions,” in Proceedings of the Symposium on String Processing and Information Retrieval, September 2000. BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity. REGULAR EXPRESSION MATCHING CAN BE SIMPLE AND FAST Regular expression matching can be simple and fast, using finite automata-based techniques that have been known for decades. In contrast, Perl, PCRE, Python, Ruby, Java, and many other languages have regular expression implementations based on recursive backtracking that are simple but can be excruciatingly slow. REGULAR EXPRESSION MATCHING IN THE WILD Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction. The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching.Both were based on toy implementations optimized for teaching REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
IMPLEMENTING REGULAR EXPRESSIONS 2 History Finite automata first introduced by McCullock and Pitts (1943) to model neurons. ‘‘A logical calculus of ideas immanent in nervous activity,’’ Bull. Math. Biophys. 5, pp. 115-133. RESEARCH!RSC: VERSIONED GO COMMANDS (GO & VERSIONING, PART 7) What does it mean to add versioning to the go command? The overview post gave a preview, but the followup posts focused mainly on underlying details: the import compatibility rule, minimal version selection, and defining go modules.With those better understood, this post examines the details of how versioning affects the go command line and the reasons for those changes. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has severalSWTCHBOARD
Created Date: 191020203151302 RESEARCH!RSC: BOURNE SHELL MACROS fanf (February 15, 2008 12:41 PM) Cambridge's influence on Unix programming languages is interesting and amusing. Martin Richards created BCPL, which inspired dmr to create B then C. BCPL was a by-product of the CPL project, which aimed to create something like a PL/1 for the Atlas/Titan computers, but was an utter failure. LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
IMPLEMENTING REGULAR EXPRESSIONS Ville Laurikari, “NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions,” in Proceedings of the Symposium on String Processing and Information Retrieval, September 2000.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawtermRESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013. ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
IMPLEMENTING REGULAR EXPRESSIONS 2 History Finite automata first introduced by McCullock and Pitts (1943) to model neurons. ‘‘A logical calculus of ideas immanent in nervous activity,’’ Bull. Math. Biophys. 5, pp. 115-133. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has severalSWTCHBOARD
Created Date: 191020203151302 LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
IMPLEMENTING REGULAR EXPRESSIONS Ville Laurikari, “NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions,” in Proceedings of the Symposium on String Processing and Information Retrieval, September 2000.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawtermRESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013. ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
IMPLEMENTING REGULAR EXPRESSIONS 2 History Finite automata first introduced by McCullock and Pitts (1943) to model neurons. ‘‘A logical calculus of ideas immanent in nervous activity,’’ Bull. Math. Biophys. 5, pp. 115-133. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has severalSWTCHBOARD
Created Date: 191020203151302 IMPLEMENTING REGULAR EXPRESSIONS Ville Laurikari, “NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions,” in Proceedings of the Symposium on String Processing and Information Retrieval, September 2000. BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity. REGULAR EXPRESSION MATCHING CAN BE SIMPLE AND FAST Regular expression matching can be simple and fast, using finite automata-based techniques that have been known for decades. In contrast, Perl, PCRE, Python, Ruby, Java, and many other languages have regular expression implementations based on recursive backtracking that are simple but can be excruciatingly slow. REGULAR EXPRESSION MATCHING IN THE WILD Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction. The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching.Both were based on toy implementations optimized for teaching REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
IMPLEMENTING REGULAR EXPRESSIONS 2 History Finite automata first introduced by McCullock and Pitts (1943) to model neurons. ‘‘A logical calculus of ideas immanent in nervous activity,’’ Bull. Math. Biophys. 5, pp. 115-133. RESEARCH!RSC: VERSIONED GO COMMANDS (GO & VERSIONING, PART 7) What does it mean to add versioning to the go command? The overview post gave a preview, but the followup posts focused mainly on underlying details: the import compatibility rule, minimal version selection, and defining go modules.With those better understood, this post examines the details of how versioning affects the go command line and the reasons for those changes. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has severalSWTCHBOARD
Created Date: 191020203151302 RESEARCH!RSC: BOURNE SHELL MACROS fanf (February 15, 2008 12:41 PM) Cambridge's influence on Unix programming languages is interesting and amusing. Martin Richards created BCPL, which inspired dmr to create B then C. BCPL was a by-product of the CPL project, which aimed to create something like a PL/1 for the Atlas/Titan computers, but was an utter failure. LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several A SYSTEM FOR TYPESETTING MATHEMATICS A System for Typesetting Mathematics Brian W. Kernighan and Lorinda L. Cherry Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This paper describes the design and implementation of a system for typesetting mathemat- RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several A SYSTEM FOR TYPESETTING MATHEMATICS A System for Typesetting Mathematics Brian W. Kernighan and Lorinda L. Cherry Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This paper describes the design and implementation of a system for typesetting mathemat- RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
IMPLEMENTING REGULAR EXPRESSIONS An introduction to using finite automata to implement regular expression matching, and why the standard backtracking implementationis a bad idea.
PATTERNS AND HINTS FOR CONCURRENCY IN GO Patterns and Hints for Concurrency in Go Russ Cox MIT 6.824 / Spring2021
REGULAR EXPRESSION MATCHING CAN BE SIMPLE AND FAST Regular expression matching can be simple and fast, using finite automata-based techniques that have been known for decades. In contrast, Perl, PCRE, Python, Ruby, Java, and many other languages have regular expression implementations based on recursive backtracking that are simple but can be excruciatingly slow. IBM 7094 CHEAT SHEET IBM 7094 Cheat Sheet Russ Cox rsc@swtch.com November 2000; updated January 2007 (sic) The IBM 7094 was a 1960s-era mainframe. Tony Van Vleck has documented its use in the CTSS system. Ken Thompson was working on an IBM 7094 running CTSS when he REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
THE TEXT EDITOR SAM
› 3 › The Command Language A file consists of its contents, which are an array of characters (that is, a string); the name of the associated disc file; the modified bit that states whether the contents match those of the disc file; and a substring of the contents, called the current text or dot (see Figures 1 and 2).SWTCH
Created Date: 191020203151302 A CONCURRENT WINDOW SYSTEM - 3 - client: prog(W, K, M) (The syntax used in this paper is based on Newsqueak, but should be mostly self-explanatory.) Once it has been invoked, the client can be represented pictorially, using arrows to represent the flow of information. RESEARCH!RSC: QART CODES research!rsc: QArt Codes. QArt Codes. Posted on Thursday, April 12, 2012. QR codes are 2-dimensional bar codes that encode arbitrary text strings. A common use of QR codes is to encode URLs so that people can scan a QR code (for example, on an advertising poster, building roof, volleyball bikini, belt buckle, or airplane banner ) to load a web RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity. IMPLEMENTING REGULAR EXPRESSIONS An introduction to using finite automata to implement regular expression matching, and why the standard backtracking implementationis a bad idea.
DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. A CONCURRENT WINDOW SYSTEM A Concurrent Window System Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT When implemented in a concurrent language, a window system can be concise. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity. IMPLEMENTING REGULAR EXPRESSIONS An introduction to using finite automata to implement regular expression matching, and why the standard backtracking implementationis a bad idea.
DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. A CONCURRENT WINDOW SYSTEM A Concurrent Window System Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT When implemented in a concurrent language, a window system can be concise. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several IMPLEMENTING REGULAR EXPRESSIONS Ville Laurikari, “NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions,” in Proceedings of the Symposium on String Processing and Information Retrieval, September 2000. REGULAR EXPRESSION MATCHING CAN BE SIMPLE AND FAST Notice that the graph's y-axis has a logarithmic scale, in order to be able to see a wide variety of times on a single graph.. From the graph it is clear that Perl, PCRE, Python, and Ruby are all using recursive backtracking. PCRE stops getting the right answer at n=23, because it aborts the recursive backtracking after a maximum number of steps.As of Perl 5.6, Perl's regular expression engine NOTES ON PROGRAMMING PROJECTS Notes on Programming Projects Russ Cox, rsc@swtch.com Introduction These are notes for people working on programming projects with me. They outline what I expect as far as the mechanics of the actual programming is concerned. For more in-depth philosophy on many of these points, you are strongly encouraged to read Kernighan and Pike's The Practice of Programming. PATTERNS AND HINTS FOR CONCURRENCY IN GO Patterns and Hints for Concurrency in Go Russ Cox MIT 6.824 / Spring2021
REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
THE TEXT EDITOR SAM
› 3 › The Command Language A file consists of its contents, which are an array of characters (that is, a string); the name of the associated disc file; the modified bit that states whether the contents match those of the disc file; and a substring of the contents, called the current text or dot (see Figures 1 and 2). A CONCURRENT WINDOW SYSTEM - 3 - client: prog(W, K, M) (The syntax used in this paper is based on Newsqueak, but should be mostly self-explanatory.) Once it has been invoked, the client can be represented pictorially, using arrows to represent the flow of information. THREADS WITHOUT LOCKS Locks protect shared mutable state.. Specifically, they protect invariants about the state.; lock(x) says “I depend on the invariants protected by x.” or “I'm about to break the invariants protected by x.Look away!” unlock(x) says “I'm done (and if I broke the invariants, I've fixed them).” Invariants always existed, just easier to break with multithreading. RESEARCH!RSC: QART CODES research!rsc: QArt Codes. QArt Codes. Posted on Thursday, April 12, 2012. QR codes are 2-dimensional bar codes that encode arbitrary text strings. A common use of QR codes is to encode URLs so that people can scan a QR code (for example, on an advertising poster, building roof, volleyball bikini, belt buckle, or airplane banner ) to load a web RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity. IMPLEMENTING REGULAR EXPRESSIONS An introduction to using finite automata to implement regular expression matching, and why the standard backtracking implementationis a bad idea.
DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. A CONCURRENT WINDOW SYSTEM A Concurrent Window System Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT When implemented in a concurrent language, a window system can be concise. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
BELL LABS AND CSP THREADS Bell Labs and CSP Threads. Russ Cox rsc@swtch.com. Also available in Serbo-Croatian, Swedish. Introduction. This page is a slice of the history of concurrent programming, focusing on one particular lineage of Hoare's language of communicating sequential processes (CSP) .Concurrent programming in this style is interesting for reasons not of efficiency but of clarity. IMPLEMENTING REGULAR EXPRESSIONS An introduction to using finite automata to implement regular expression matching, and why the standard backtracking implementationis a bad idea.
DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. A CONCURRENT WINDOW SYSTEM A Concurrent Window System Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT When implemented in a concurrent language, a window system can be concise. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several IMPLEMENTING REGULAR EXPRESSIONS Ville Laurikari, “NFAs with Tagged Transitions, their Conversion to Deterministic Automata and Application to Regular Expressions,” in Proceedings of the Symposium on String Processing and Information Retrieval, September 2000. REGULAR EXPRESSION MATCHING CAN BE SIMPLE AND FAST Notice that the graph's y-axis has a logarithmic scale, in order to be able to see a wide variety of times on a single graph.. From the graph it is clear that Perl, PCRE, Python, and Ruby are all using recursive backtracking. PCRE stops getting the right answer at n=23, because it aborts the recursive backtracking after a maximum number of steps.As of Perl 5.6, Perl's regular expression engine NOTES ON PROGRAMMING PROJECTS Notes on Programming Projects Russ Cox, rsc@swtch.com Introduction These are notes for people working on programming projects with me. They outline what I expect as far as the mechanics of the actual programming is concerned. For more in-depth philosophy on many of these points, you are strongly encouraged to read Kernighan and Pike's The Practice of Programming. PATTERNS AND HINTS FOR CONCURRENCY IN GO Patterns and Hints for Concurrency in Go Russ Cox MIT 6.824 / Spring2021
REGULAR EXPRESSION MATCHING WITH A TRIGRAM INDEX Regular Expression Matching with a Trigram Index or How Google Code Search Worked Russ Cox rsc@swtch.com January 2012 Introduction. In thesummer of 2006, I
THE TEXT EDITOR SAM
› 3 › The Command Language A file consists of its contents, which are an array of characters (that is, a string); the name of the associated disc file; the modified bit that states whether the contents match those of the disc file; and a substring of the contents, called the current text or dot (see Figures 1 and 2). A CONCURRENT WINDOW SYSTEM - 3 - client: prog(W, K, M) (The syntax used in this paper is based on Newsqueak, but should be mostly self-explanatory.) Once it has been invoked, the client can be represented pictorially, using arrows to represent the flow of information. THREADS WITHOUT LOCKS Locks protect shared mutable state.. Specifically, they protect invariants about the state.; lock(x) says “I depend on the invariants protected by x.” or “I'm about to break the invariants protected by x.Look away!” unlock(x) says “I'm done (and if I broke the invariants, I've fixed them).” Invariants always existed, just easier to break with multithreading. RESEARCH!RSC: QART CODES research!rsc: QArt Codes. QArt Codes. Posted on Thursday, April 12, 2012. QR codes are 2-dimensional bar codes that encode arbitrary text strings. A common use of QR codes is to encode URLs so that people can scan a QR code (for example, on an advertising poster, building roof, volleyball bikini, belt buckle, or airplane banner ) to load a web RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm REGULAR EXPRESSION MATCHING IN THE WILD Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction. The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching.Both were based on toy implementations optimized for teaching ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several RESEARCH!RSC: HOW MANY GO DEVELOPERS ARE THERE? How many Go developers are there? Multiply the low developer count and Go percentages and the high ones. In July 2017, 3–4.6% of 16.8–21 million yielded an estimate of 0.50–0.97 million Go developers. In July 2018, 4.6–7.1% of 18.4–23 million yielded an RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm REGULAR EXPRESSION MATCHING IN THE WILD Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction. The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching.Both were based on toy implementations optimized for teaching ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several RESEARCH!RSC: HOW MANY GO DEVELOPERS ARE THERE? How many Go developers are there? Multiply the low developer count and Go percentages and the high ones. In July 2017, 3–4.6% of 16.8–21 million yielded an estimate of 0.50–0.97 million Go developers. In July 2018, 4.6–7.1% of 18.4–23 million yielded an RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
IMPLEMENTING REGULAR EXPRESSIONS RE2 regular expression library. Efficient automaton-based implementation of Perl-syntax regular expressions (excluding backreferences). Written by Russ Cox. Plan 9 regular expression library. Efficient (non-backtracking) NFA implementation with submatch tracking. Accepts UTF-8 and wide-character Unicode input. Traditionalegrep syntax only.
REGULAR EXPRESSION MATCHING CAN BE SIMPLE AND FAST Notice that the graph's y-axis has a logarithmic scale, in order to be able to see a wide variety of times on a single graph.. From the graph it is clear that Perl, PCRE, Python, and Ruby are all using recursive backtracking. PCRE stops getting the right answer at n=23, because it aborts the recursive backtracking after a maximum number of steps.As of Perl 5.6, Perl's regular expression engine REGULAR EXPRESSION MATCHING IN THE WILD Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction. The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching.Both were based on toy implementations optimized for teachingTHE TEXT EDITOR SAM
› 3 › The Command Language A file consists of its contents, which are an array of characters (that is, a string); the name of the associated disc file; the modified bit that states whether the contents match those of the disc file; and a substring of the contents, called the current text or dot (see Figures 1 and 2). RESEARCH!RSC: REPRODUCIBLE, VERIFIABLE, VERIFIED BUILDS A verifiable build is one that records enough information to be precise about exactly how to repeat it. A verified build is one that checks that it is using the expected source code. Vgo delivers reproducible builds by default. The resulting binaries are verifiable, in that they record versions of the exact source code that went intothe build.
SWTCHBOARD
Created Date: 191020203151302 TRANSPARENT LOGS FOR SKEPTICAL CLIENTS T L S C B is a record in the Merkle tree with hashTis done by giving averifiable com-
RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
RESEARCH!RSC: QART CODES research!rsc: QArt Codes. QArt Codes. Posted on Thursday, April 12, 2012. QR codes are 2-dimensional bar codes that encode arbitrary text strings. A common use of QR codes is to encode URLs so that people can scan a QR code (for example, on an advertising poster, building roof, volleyball bikini, belt buckle, or airplane banner ) to load a web COMPUTING SCIENCE TECHNICAL REPORT NO. 143 Newsqueak: A Language for Communicating with Mice Rob Pike This is an informal reference manual for the concurrent language Newsqueak. Newsqueak’s roots are in Squeak, a language designed a few years ago by Luca Cardelli and LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm REGULAR EXPRESSION MATCHING IN THE WILD Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction. The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching.Both were based on toy implementations optimized for teaching ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several RESEARCH!RSC: HOW MANY GO DEVELOPERS ARE THERE? How many Go developers are there? Multiply the low developer count and Go percentages and the high ones. In July 2017, 3–4.6% of 16.8–21 million yielded an estimate of 0.50–0.97 million Go developers. In July 2018, 4.6–7.1% of 18.4–23 million yielded an RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
LIBTASK: A COROUTINE LIBRARY FOR C AND UNIX Libtask: a Coroutine Library for C and Unix write event-driven programs without the hassle of events! available for FreeBSD, Linux,OS X, and Solaris
RUSS COX - SWTCH
Russ Cox and William Josephson. MIT LCS Technical Memo MIT-LCS-TM-650,2004.
RESEARCH!RSC
My Go Resolutions for 2017 January 2017. What I would like to do for Go in 2017. Go and Dogma January 2017. Programming language dogmatics. Lock-Free Bugs January 2017. Locked frees and freed locks. Version SAT December 2016. Dependency hell is NP-complete. Hacking the OS X Kernel for Fun and Profiles August 2013.DRAWTERM - SWTCH
LICENSE SOURCE ----- https://github.com/9fans/drawterm/ In the Plan 9 distribution: /sys/src/cmd/unix/drawterm/ (sometimes out of date) OLD BINARIES ----- drawterm REGULAR EXPRESSION MATCHING IN THE WILD Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction. The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching.Both were based on toy implementations optimized for teaching ALEF LANGUAGE REFERENCE MANUAL Alef Language Reference Manual Phil Winterbottom philw@plan9.att.com Introduction Alef is a concurrent programming language designed forsystems software.
A TOUR OF GO
Session 1. Nuts and Bolts This session introduces the basics of Go program construction. At the end you should be able to write programs that import packages, define functions, call functions, iterate, and use simple data structures. THE IMPLEMENTATION OF NEWSQUEAK The Implementation of Newsqueak Rob Pike AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT The implementation of the concurrent applicative language Newsqueak has several RESEARCH!RSC: HOW MANY GO DEVELOPERS ARE THERE? How many Go developers are there? Multiply the low developer count and Go percentages and the high ones. In July 2017, 3–4.6% of 16.8–21 million yielded an estimate of 0.50–0.97 million Go developers. In July 2018, 4.6–7.1% of 18.4–23 million yielded an RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
IMPLEMENTING REGULAR EXPRESSIONS RE2 regular expression library. Efficient automaton-based implementation of Perl-syntax regular expressions (excluding backreferences). Written by Russ Cox. Plan 9 regular expression library. Efficient (non-backtracking) NFA implementation with submatch tracking. Accepts UTF-8 and wide-character Unicode input. Traditionalegrep syntax only.
REGULAR EXPRESSION MATCHING CAN BE SIMPLE AND FAST Notice that the graph's y-axis has a logarithmic scale, in order to be able to see a wide variety of times on a single graph.. From the graph it is clear that Perl, PCRE, Python, and Ruby are all using recursive backtracking. PCRE stops getting the right answer at n=23, because it aborts the recursive backtracking after a maximum number of steps.As of Perl 5.6, Perl's regular expression engine REGULAR EXPRESSION MATCHING IN THE WILD Regular Expression Matching in the Wild Russ Cox rsc@swtch.com March 2010 Introduction. The first two articles in this series, “Regular Expression Matching Can Be Simple And Fast” and “Regular Expression Matching: the Virtual Machine Approach,” introduced the foundation of DFA-based and NFA-based regular expression matching.Both were based on toy implementations optimized for teachingTHE TEXT EDITOR SAM
› 3 › The Command Language A file consists of its contents, which are an array of characters (that is, a string); the name of the associated disc file; the modified bit that states whether the contents match those of the disc file; and a substring of the contents, called the current text or dot (see Figures 1 and 2). RESEARCH!RSC: REPRODUCIBLE, VERIFIABLE, VERIFIED BUILDS A verifiable build is one that records enough information to be precise about exactly how to repeat it. A verified build is one that checks that it is using the expected source code. Vgo delivers reproducible builds by default. The resulting binaries are verifiable, in that they record versions of the exact source code that went intothe build.
SWTCHBOARD
Created Date: 191020203151302 RESEARCH!RSC: VERSION SAT Dependency hell is NP-complete. But maybe we can climb out. The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packagesare selected).
TRANSPARENT LOGS FOR SKEPTICAL CLIENTS T L S C B is a record in the Merkle tree with hashTis done by giving averifiable com-
RESEARCH!RSC: QART CODES research!rsc: QArt Codes. QArt Codes. Posted on Thursday, April 12, 2012. QR codes are 2-dimensional bar codes that encode arbitrary text strings. A common use of QR codes is to encode URLs so that people can scan a QR code (for example, on an advertising poster, building roof, volleyball bikini, belt buckle, or airplane banner ) to load a web COMPUTING SCIENCE TECHNICAL REPORT NO. 143 Newsqueak: A Language for Communicating with Mice Rob Pike This is an informal reference manual for the concurrent language Newsqueak. Newsqueak’s roots are in Squeak, a language designed a few years ago by Luca Cardelli andSWTCHBOARD
~rsc/
Russ Cox
astro/
Do you know where your planets are?cmd/
In the beginning was the command line...drawterm/
Plan 9 terminal emulatorirc/
an IRC client for acmejavascript/
JavaScript playgroundjuke/
a juke-box music player for acmelibtask/
simple thread-based event-driven programminglinks/
Links
linux/
Linux help
plan9history/
Plan 9 Kernel Historyplan9port/
Plan 9 from User Space~rsc/regexp/
Implementing regular expressionstra/
File system synchronizerunix/
You are not expected to understand this.v9fs/
9P2000 file protocol for Linuxxword/
Crossword puzzle player (requires JavaScript)Details
5
Copyright © 2024 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0